5. Write code for a recursive pre-order or post-order traversal (your choice) of a k-ary tree that prints the nodes values out. Assume a generic Node class with a data field and an array of node children (writing this class out may be helpful to you). 6. Write the code for a recursive method to calculate the size or height (your choice of a binary tree. Assume a generic Node class with a data field and separate left and right child fields (writing this class out may be helpful to you)