java

Question 2 True False and Why? A. Since HashSets are unordered, there is no reason to use them in comparison to TreeSets. B. Accessing a random index in an ArrayList is slower than accessing a random index in a Linkedlist. C. You can quickly find an associated Key in a Map based on it's Value D. Arrays are inferior to ArrayLists because arrays are fixed in size E. Quick Sort. Mergesort and HeapSort are all interchangeable because they all have the exact same runtime Edit View Insert Format Tools Table 12pt Paragraph 2T D $