Store the values 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 in the given order in an array (I'm assuming the array begins at index 0, but you can make suitable adjustments to index starting at 1 if you prefer). The array may be thought of as a binary tree where the left child of node i is at 2i+1 and the right child is at 2i+2. With that in mind, write code to print the tree in i. Preorder ii. Inorder Postorder