Problem 5. A program Thunk written by a graduate student uses an implementation of the sequence ADT as its main component. It performs atRank, insertAtRank and remove operations in some unspecified order. It is known that Thunk performs atRank operations, n insertAtRank operations, and ^ remove operations. Which implementation of the sequence ADT should the student use in the interest of efficiency: the array-based one or the one that uses a doubly-linked list? Explain