2．　　假设以数组sequ[m]存放循环队列的元素，同时设变量rear和quelen 分别指示循环队列中队尾元素的位置和内含元素的个数。编写实现该循环队列的入队和出队操作的算法。提示：队空的条件：sq->quelen==0；队满的条件：sq->quelen==m。-2. Assuming an array sequ [m] cycle queue storage elements, while the variable set, respectively, rear and instructions cycle quelen squadron tail queue element contains the location and the number of elements. Prepared to achieve the cycle queue into teams and teams of the algorithm operation. Tip: Force air-conditions: sq->　quelen == 0　team full conditions: sq->　quelen == m.