1) Put the given numbers into an array int A[48].

97   24   77   58   76   92   43   68   18   52   55   53  

33   39   22   73   49   47   17   27   45   67   20   21  

35   63   19   64   81   51   97   29   98   20   53   14  

94   24   29   86   46   65   58   65   27   65   39   56.

Use selection sort to sort A[48] into increasing order, and then print out the sorted list in four rows. There may be duplicates, but that's OK. (65 and 53 appear twice.) Duplicates will appear next to each other in the sorted list.

2) Program binary search. .

Your program should give a prompt to the user "Please enter the number to search for."

After doing the binary search, your program should print out either

* Your number is in position ____, which is a number between 0 and 47.

When there are duplicates, such as 65, or 53, the program will print out the position of one of them.

The TA will come by to test your program. He will give you 3 numbers:

*A number not in the list.

*A number such as 65 that appears more than once.

*A number that appears exactly once.

your code should print out

"*I'm sorry, your number was not in the list."

If it is not in the list