Implement the dictionary ADT of Figure 4.27 using an unsorted linked list as defined by class LList in Figure 4.8. Make the implementation as efficient as you can, given the restriction that your...

Implement the dictionary ADT of Figure 4.27 using an unsorted linked list as defined by class LList in Figure 4.8. Make the implementation as efficient as you can, given the restriction that your implementation must use the unsorted linked list and its access operations to implement the dictionary. State the asymptotic time requirements for each function member of the dictionary ADT under your implementation.