Given int number[8] = {15, 27, 16, 49, 62, 75, 83, 96}, and the target values of 83, assuming that binary search is used, list the values of all the array elements which will be compared with 83, in the order in which they will be compared, before binary search concludes that 83 occurs in the array? How many elements compared with 83: ____ Value of second element compared with 83: ____ Value of second element compared with 83: ____ Value of third element compared with 83: ____ Values of other elements compared with 83, if any: ____ Assuming the declaration for a structure named FUN as given below, write C code to declare an array named my_fun of size 20, each of whose elements is of type FUN. typdef struct {char* x: char y: int z[200];} FUN: The required declaration: _____ A sorting algorithm is used to sort an int array with initial contents as shown below: After two passes of the sorting algorithm are executed, the array contents are in increasing order, as shown below: Name of the sorting algorithm used is: ____