a) Create a file homework_part_1.c b) Create a function initialize_array that receives two parameters: an array of integers and the array size. Use a for loop and an if statement to put 0s in the odd positions of the array and 1s in the even positions. Hint: review pointers as parameters. c) Create a function print_array that receives as parameters an array of integers and the array size. Use a for statements to print all the elements in the array. Hint: review pointers as parameters. d) Create a function selection_sort that receives as parameters an array of integers and the array size, and order the array element in ascending order. Implement Selection Sort algorithm. It should be Selection Sort, not Bubble Sort, not Quick Sort, etc. If you do not remember selection sort, this link could be useful: https://goo.gl/hrAdMo e) Create a recursive function that calculate and returns the factorial of a number. The function receives the number (integer number) as parameter f) Copy the following main function in your class, int main() { int a [10] = {3, 5, 6, 8, 12, 13, 16, 17, 18, 20}; int b [6]= {18, 16, 19, 3 ,14, 6}; int c [5]= {5, 2, 4, 3, 1}; // testing initialize_array print_array(a, 10); // print: 3, 5, 6, 8, 12, 13, 16, 17, 18, 20 initialize_array(a, 10); print_array(a, 10); // print: 1, 0, 1, 0, 1, 0, 1, 0, 1, 0 // testing initialize_array print_array(b, 6); // print: 18, 16, 19, 3 ,14, 6 selection_sort (b, 6); print_array(b, 6); // print: 3, 6, 14, 16, 18, 19 // testing factorial printf("Factorail of 5 - %d ", factorial (5)); //print: 120 c[0] = factorial (c[0]); c[1] = factorial (c[2]); print_array(c, 5); // print: 120, 24, 4, 3, 1 return 0; }