1. Its definition uses a loop. Replace that definition with a recursive one, and show that it is O( n ). 2. Consider an ADT front list , which restricts insertions, removals, and retrievals to the...

1. Its definition uses a loop. Replace that definition with a recursive one, and show that it is O( n ).

2. Consider an ADT front list , which restricts insertions, removals, and retrievals to the first item in the list. Define and implement a class for the ADT stack that is a descendant of FrontList .