Inserting an item into an unsorted list and inserting into a sorted list are the same time complexity. (2) In array-based implementation, deleting from a sorted list requires that the elements below the one being deleted be moved up one slot. 3) You can perform a binary search on both a linked-based implementation and an array-based implementation. (4) The next item in a linked list always can be found by accessing the next physical location in memory. (5) If currPtr++ points to a node in a dynamic linked list, the operation currPtr++ advances to the next node in the list. type parameters. 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