b. Given the array representation of a binary tree [null value means the node is empty]: (null, P, T, X, null, S, Q, U, null, null, Y, W, R, null, null, V i. Draw the binary tree. [2] ii. Write the post-order and in order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]