Student Name __________ Answer True or False to the following problems. Inserting an item into an unsorted list and inserting into a sorted list are the same time complexity. __________ In array-based implementation, deleting from a sorted list requires that the elements below the one being deleted be moved up one slot. ____________ You can perform a binary search on both a linked-based implementation and an array-based implementation. ___________ The next item in a linked list always can be found by accessing the next physical location in memory. ___________ lf currPtr points to a node in a dynamic linked list, the operation currPtr++ advances to the next node in the list.________ A class template allows the compiler to generate multiple versions of a class type by using type parameters.______________ Briefly answer the following questions. (1) What is the difference between a shallow copy and a deep copy? (2) When a copy constructor (a special member function) of a class is implicitly called? Please use Big-O notations such as O(N) to indicate the time-complexity of each following operation. Note the length of the list is N (A) Retrieve Item in an Unsorted List: ___________ (B) Retrieve Item in a Sorted List using binary search: ___________ (C) Insert Item in an Unsorted List: ___________ (D) Insert Item a Sorted List: __________