1. Define StackQueue as an abstract data type containing the operations of both stack and queue. In StackQueue, the top of StackQueue is the same as the front of the StackQueue. Based on the program below, write down the output. (20%) If StackQueue X contains numbers {1, 2, 3, 4), where 1 is the front/top, the print format "print(x)" is "(front/top) 1 2 3 4 (rear)". StackQueue *A, *B; A = malloc(sizeof(StackQueue)); B = malloc(sizeof(StackQueue)); push(A, 2); push(A, 3); push(A, 5); push(A, 7); push(A, 11); print(A); // part (a) enqueue (B, 2); enqueue (B, 4); enqueue(B, 6); enqueue (B, 8); enqueue (B, 10); print(); // part (b) enqueue(B, topandpop(A)); print(B); // part (c) push(A, dequeue(B) * dequeue(B)); print(A); // part (d) pop(B); pop(); dequeue(B); push(B, dequeue(A) + top()); print(B); // part (e) free_StackQueue(A); free_StackQueue (B)