True/False questions: 7. Arrays do not allow efficient random access. 8. On average, appending to the end of a Python list is a (n) operation. 9. Inserting into the middle of Python list is a (n) operation. 10. Card(6, "c") < Card(3, "s") 11. Python is unique in that it has a built-in container type that implements a general mapping (dictionaries). 12. Python dictionary keys must be immutable objects. 13. Looking up an item in a Python dictionary is a (n) operation Multiple Choice Questions 1. Which of the following is not true of Python lists? a) They are implemented underneath as contiguous arrays. b) All of the items in a list must be of the same type. c) They can grow and shrink dynamically. d) They allow for efficient random access. 2. Which of the following is a (n) operation? a) Appending to the end of a Python list. b) Sorting a list with selection sort. c) Deleting an item from the middle of a Python list. d) Finding the ith item in a Python list. 3. Which of the following is not a method of the Deck class presented in the chapter? a) size b) shuffle c) deal d) All of the above are methods of the class.