Consider tree from the lectures on slide 10, write down the nodes in order as pro-
cessed by:
1. inorder traversal,
2. preorder traversal,
3. postorder traversal,
4. level-order traversal.

Assume you need to test a function named inorder. the function inorder receives three int arguments and returns true if and only if the arguments are in non-decreasing order: that is, the second argument is not < the first and the third is not < the second. write the definition of driver function testinorder whose job it is to determine whether inorder is correct. so testinorder returns true if inorder is correct and returns false otherwise. for the purposes of this exercise, assume inorder is an expensive function call, so call it as few times as possible!