设计算法，实现线性结构上的单链表的产生以及元素的查找、插入与删除。具体实现要求：（1）从键盘输入n个整数，以0作为结束标记，产生不带表头的单链表，并输入结点值。（2）从键盘输入1个整数，在单链表中查找该结点的位置。若找到，则显示“找到了”；否则显示“找不到”。（3）从键盘输入2个整数，一个表示欲插入的位置i，另一个表示欲插入的数值x，将x插入在对应位置上，输出单链表所有结点值，-Design algorithm for linear structural elements of a single generation and the list of search, insert and delete. Specific implementation requirements: (1) of n integers from the keyboard input to 0 as the closing tag, creating a single non-header list, and enter the node values. (2) Enter an integer from the keyboard in a single linked list to find the location of the node. If found, it shows " found"　 otherwise display " not found."　(3) Input 2 integers from the keyboard, a position that want to insert i, the other that want to insert the value x, the x inserted in the corresponding position, the output values ​ ​ of a single linked list of all nodes,