There are three questions here, please help

b. If a linear search is performed on an array, and it is known that some items are searched for more frequently than others, how can the contents of the array be reordered to improve the average performance of the search? (Si se realiza una bsqueda lineal en un arreglo, y se sabe que algunos elementos se buscan con ms frecuencia que otros, cmo se puede reordenar el contenido del arreglo para mejorar el rendimiento promedio de la bsqueda? c. Define the following array: payRate, a 25-element array of doubles d. Define the following array: letter, a 26-element array of chars