quick

estion 3 - Brute force algorithms 120 points) Illustrate the operation of the bubble sort algorithm on the following input: (14 33 27 10 35 19 42] Show only the first 6 iterations. In each iteration indicate which elements were changed. (10 pts) Briefly explain how the knapsack problem is solved using the exhaustive search approach. (4 pts)