Question No. 7. Write a java/c++ code_or an algorithm to solve the following problem. After that dry run and show output of algorithm using an example binary tree. Without dry run no marks will be awarded. [10] 1) Write a recursive function to write the parent of the all the nodes while traversing. Like if you traverse the root node write the current node a, parent null. Then if you go to left sub tree, your code will show, current node : b, parent a and so on