If the array hsa random integers of size n, then the best sorted technique to sort the array is Select one: O a. Selection sort O b. Insertion sort Oo. Bubble sort Od. No best, we can choose any The brute force (BF) of polynomial evaluation time is O a. O(1) O b. O(n?) O c. O(log n) 0 d. On) "In Place Algorithm' means that the algorithm doesn't take memory Select one O True O False The best case of Boyer Moore algorithm is Select one: a. Om O b. O(nm) OC. O(n) O d. On/m) The best case of time complexity of sequential search that finds all keys is n Select one: True O False