2. Since binary search has a better big 0 runtime, is there ever a reason or situation to use a linear search? Explain. 3. Quick sort has a worst case run time of O(n) but more often than not performs as one of the fastest sorting algorithms. Why is this? In what situation does quicksort run its worst case runtime