Indicate if the following statements are True or False: Binary search will work correctly when performed on an unsorted list. The worst case running time of insertion sort is O(n?). The average case running time of quicksort is O(n lg n). In a hash table structure, with chaining for collision resolution, the size of the hash table must be greater than or equal to the number of data items. External nodes may have different depths in a (2, 4) Tree