CISC220 Celebration of Knowledge 2 Name Class Time Version CODE: (12 pts) Choose one of the following Options And writhe the method/function (Note, you may choose to do a second one for Extra Credit 8 pts) CLEARLY state which one you are choosing to do. A. Write the method for adjusting heights B. Write a method for reversing aC. Write a function that takes as after inserting into an avl tree. Assume you singly linked list (Note: this should input parameters two root nodes of have the following methods: be a relatively short method) max(Node left, Node *right) returns max height of the two nodes rotateRight(Node *n) method that rotates right a rotateleft(Node *n) method that rotates left around n void setParents(Node Oldn, Node *n) 2 binary search trees, and returns true if the data in the trees are identical (meaning the same numbers at the same locations), and false if the trees are not identical ethod that sets the parent of n to be the parent of old n, and sets the parent's left or right child to be n, accordingly. . int getBalance(Node*n) method that returns the balance of n