1. (20 points) Sorting the following asymptotic growth rates in an increasing order: p", n, 2?", n, logn, (logn)?, 1. 2. (20 points) Using Figure 10.1 (Textbook Exercise 10.1-1) as a model, illustrate the result of each operation in the sequence PUSH(S, 4), PUSH(S. 1), PUSH(S, 3), POP(S), PUSH(S, 8), and POP(S) on an initially empty stack S stored in array S[1, 2, ..., 6). 3. (20 points) Using Figure 10.2 (Textbook Exercise 10.1-3) as a model, illustrate the result of each operation in the sequence ENQUEUE(Q, 4), ENQUEUE(Q.1). ENQUEUE(Q, 3), DEQUEUE(Q), ENQUEUE(Q, 8), and DEQUEUE(Q) on an initially empty queue Q stored in array Q[1, 2, ..., 6). 4. (20 points) The structure of a singly linked list is shown as follows: key next Link.head-1 Implementing the operations Insert and Delete on a singly linked list. Please give the pseudocode for your implementation (Hint: refer to the operations on a doubly linked list in Chapter 10.2). 5. (20 points) Draw the binary tree rooted at index 6 that is represented by the following attributes: index key left right 1 2 4 S 6 7 8 9 10 12 15 4 10 2 18 7 14 21 5 7 8 10 5 NIL 1 NIL 6 NIL NIL 3 NIL NIL 9 NIL 4 NIL 2 NIL NIL