Q3 Given the following binary tree, show the order of the elements if a. Inorder traversal is performed. b. Preorder traversal is performed. c. Postorder traversal is performed. 16 39 49 56 64 Q4 . Given the array of numbers, show the elements of the array after each iteration of selection sort, bubble sort, and insertion sort. The algorithms will sort the array in increasing order. x[1] x[2] x[3] x[4] x[5] x[6] 3 7 9 12 6 10 x[1] x [2] x[3] x[4] x[5] x [6] 12 9 6 10 3 7 For instance, after the first swap of the bubble sort, the array will have the following elements: