DATA STRUCTURE

please i need this very fast pleasssse

Q5. If a Queue is implemented using an array of size Array_Size, the Queue gets full when: a.b.c.d.Rear=ArraySize1Front=rear+1Rear=frontNoneoftheabove Q6. The maximum number of elements in a heap of height h is : a. 2h+11 b. 2h c. 2h1 d. 2h1 \begin{tabular}{|ll} \hline Exercise 2: Trees [PLO K2/CLO 2/ SO 1] [2* 6=12marks ] \end{tabular} 2.1 Draw the binary search tree that is created if the following numbers are inserted in the tree in the given order: 11,7,9,8,10,14,3,5 2.3 Create a full binary serchll hence one of theno only has one child 2.3 Create a full binary search tree containing the same nodes (numbers) given in part (2.1). 2.4 For the tree created in part (2.1), list the nodes in a post-order traversal. 2.5 For the tree created in part (2.1), list the nodes in an in-order traversal. 3 etween 2.6 Show the tree after deleting the node 10