21) Complete the following (26) 13+1 bonus 1 is an effective method for solving a problem expressed as a finite sequence of instructions. It's used for calculation data processing, and many other fields 2 is a well-known sorting algorithm, on average, makes Oin log n) comparisons to sort n items 3 is An algorithm that is designed essentially to find a path of minimum length between two specified vertices of a connected weighted graph 4. Minimum spanning tree is a good example for Algorithm design techniques 5. Filling color is a good example for Algorithm design techniques 6. Binary search is a good example for Algorithm design techniques, 7. Bubble sort use swap to sort data, but sort use shift G(V.E) is a graph, if (E log E less than V?) the best Algorithm to find Minimum spanning tree is 9. The best pivot number to sort the following data using quick sort is: 20 13 17 12 7 5 33 10. (Root, Right, Left) the rule for BT Traversal. (write traversal name) 11. The time complexity for Nonrecursive Inorder Traversal egaul_ 12. The time complexity for Breadth first search egaul_ 13. The time complexity for Binary search egaul 14. Move the largest value to the end using pair-wise comparisons and swapping is sort