problem 1: One of the most general sorting methods we have in programming is the ‘Bubble Sort’. This method can be used to sort an array of elements in ascending order.

prepare down the sample code that will rearrange a list of numbers stored in an array in ascending order by using the Bubble Sort.

problem 2:

a) What do you understand by linear search? Describe with a simple algorithm of your own.

b) Describe how the binary search distinct from the linear search? Use a simple algorithm of the binary search to describe your answer.

problem 3:

a) Describe the FIFO structure of the queue.

b) Describe how you would implement the queue data structure in its simplest form. Describe your answer fully with the essential sample code.