自行编写链式存储队列的基本运算子程序(名称不变)

实现以下功能：

①创建一个空的链式队列；

②判断新建的链式队列是否为空；

③提示用户输入“链式队列的长度”；

④根据用户输入的“链式队列的长度”，逐一提示

用户输入“链式队列中的各个元素”，完成链式

队列的构造；

⑤判断此时的链式队列是否为空；

⑥调用子程序打印当前链式队列的队首元素和队尾

元素；

⑦编写打印链式队列元素的子程序PrintNode( )；

⑧清空队列，连续3次做下列操作：入队4个元素，

出队2个元素，打印链式队列，打印当前链式队列

的队首元素和队尾元素；

⑨要求：提供尽可能友好的人机对话界面，便于用

户（非程序设计者）使用。-Write your own chain store queue basic computing subroutine (name unchanged) to achieve the following functions: ① Create an empty queue chain　② new chain determine whether the queue is empty　③ prompt the user to enter the " chain length of the queue "　 ④ according to the input of the"　queue chain length " , the user is prompted by one"　chain each queue element " , the completion queue chain structure　⑤ chain determine at this time whether the queue is empty　⑥ call subroutine Print this queue chain elements and the first team squad last element　⑦ write subroutines print queue chain elements PrintNode ()　⑧ empty the queue for three consecutive times to do the following: four elements into the team, the team 2 elements, chain print queues, print the current queue chain elements and the first team squad last element　⑨ requirements: provide as friendly interactive interface for the user (non-programmers) use.