please hurry

Question 3 Y 0 0 00 0 0 R0 P Q R S T U V W X P 0 1 1 0 0 0 0 0 0 Q0010100000 R 0 0 0 1 0 0 1 0 0 0 s 0 0 1 0 0 1 1 1 0 1 0 0 T 0 0 0 0 0 1 0 0 0 0 o| 0 0 v 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 T 0000 U | | | | | | | | | | u 000 000 00 V 0 0 0 11 0000 0000 M 1 x 0 0 0 0 0 0 0 0 0 0 Y 0 0 0 0 0 1 0 0 1 | Y 0 0 0 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]