Need these answers ASAP:

b. Given the array representation of a binary tree (null value means the node is empty]: [null, Z, K, M, null, L, O, P, null, null, S, null, null, R, N, A] i. Draw the binary tree. [2] ii. Write the pre-order and in-order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]