Need help answering some problems using Binary Tree Algorithms...

What nodes would P and C be referencing after the method find Node was invoked to locate: The node with key 4 in the tree on the right? The node with key 5 in the tree on the right? The squareroot node in the tree on the right? After returning from find Node(key, p, c): give the code to: (don't consider the Tree Node Wrapper class) Fetch a deep copy of the node with key 4. Insert the node with key field 5. Delete the node with key field 6. Delete the node with key field 8. Give the Case number of the portion of the Delete algorithm performed in question: 2c above. 2d above. 4- On the back of the page, give the array that stores the above tree. Simply fill in the keys into each element of the array, although each element would actually store a reference to the node's deep copy. What nodes would P and C be referencing after the method find Node was invoked to locate: The node with key 4 in the tree on the right? The node with key 5 in the tree on the right? The squareroot node in the tree on the right? After returning from find Node(key, p, c): give the code to: (don't consider the Tree Node Wrapper class) Fetch a deep copy of the node with key 4. Insert the node with key field 5. Delete the node with key field 6. Delete the node with key field 8. Give the Case number of the portion of the Delete algorithm performed in question: 2c above. 2d above. 4- On the back of the page, give the array that stores the above tree. Simply fill in the keys into each element of the array, although each element would actually store a reference to the node's deep copy