Q1.1 2 Points Using an Ordered Linked List discussed in lecture and the textbook, the add(self, item) method compares integer values. If we used this exact implementation to order our own Objects (instead of integers), then we must modify our Object's class definition to support the > operator. True O False Q1.2 2 Points The Bubble Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False The optimized Bubble Sort implementation ( shortBubbleSort(alist)) discussed in the textbook runs in O(n) time in all cases (assuming there are n elements in the list). True O False Q1.4 2 Points The Selection Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False Q1.5 2 Points The Insertion Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False Q1.1 2 Points Using an Ordered Linked List discussed in lecture and the textbook, the add(self, item) method compares integer values. If we used this exact implementation to order our own Objects (instead of integers), then we must modify our Object's class definition to support the > operator. True O False Q1.2 2 Points The Bubble Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False The optimized Bubble Sort implementation ( shortBubbleSort(alist)) discussed in the textbook runs in O(n) time in all cases (assuming there are n elements in the list). True O False Q1.4 2 Points The Selection Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False Q1.5 2 Points The Insertion Sort implementation discussed in lecture and the textbook runs in O(n^2) time in all cases (assuming there are n elements in the list). O True O False