Recall the load balancing problem where the goal is to minimize the makespan, the maximumload on any one machine. Now we have m slow machines and k fast machines. Each fastmachine perform twice as much work as a slow machine. Now we have n jobs with loadt1; t2; ; tn on the slow machines. Assign the jobs such that we minimize the maximum totalprocessing time on any machine. Design a polynomial algorithm that has a 3-approximationto the optimal solution.

Consider the following function main: int main() { int alpha[20]; int beta[20]; int matrix[10][4]; . . } a. write the definition of the function inputarray that prompts the user to input 20 numbers and stores the numbers into alpha. b. write the definition of the function doublearray that initializes the elements of beta to two times the corresponding elements in alpha. make sure that you prevent the function from modifying the elements of alpha. c. write the definition of the function copyalphabeta that stores alpha into the first five rows of matrix and beta into the last five rows of matrix. make sure that you prevent the function from modifying the elements of alpha and beta. d. write the definition of the function printarray that prints any onedimensional array of type int. print 15 elements per line. e. write a c11 program that tests the function main and the functions discussed in parts a through d. (add additional functions, such as printing a two-dimensional array, as needed.)