Using thestudent class in Exercise 4, write a recursive version of the mediod diat displays only the name of theith student in a linked list of students. Assume diati ≤1 and that the linked list contains at leasti nodes. (Hint: Ifi= 0, print the name of the first student in the list; otherwise, print die(i - 1)th student name from the rest of the list.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.