Draw a valid 12 node binary min heap. Print the keys as encountered in a preorder traversal. Is the output sorted? Justify your answer Attempt the same question for inorder and postorder traversal. No code is required.