Which of the following is a best case input to Bubble Sort? a. a sorted array with values in increasing order b. a reverse-sorted array with values in decreasing order c. an array full of random values d. all of the above are best case inputs Which of the following is a worst case input to Bubble Sort? a. a sorted array with values in increasing order b. a reverse-sorted array with values in decreasing order c. an array full of random values d. all of the above are worst case inputs Which sorting algorithm has the most efficient runtime in the worst case, in terms of BigOh? a. Bubble Sort b. Selection Sort c. Insertion Sort d. there is a tie