In one of the labs, you developed a C module that implements a list collection. It used a dynamically allocated struct and a dynamically allocated array as the underlying data structure. Here is the declaration of the list's "type": typedef struct { 1nt *elems; // Points to the backing array of ints. int capacity; // Maximum number of elements in the list. int size; // Current number of elements in the list. } list_t; On the ruled lines, write the body of a function named list_even_bigger'_than_odd. The function prototype is: _Bool 1ist_even_bigger_than_odd(list_t *a_list); The function returns t rue if the largest even number in the list is greater than the largest odd number, and false if the largest even number in the list is less than the largest odd number. The function must terminate (via assert) if it is passed a NULL pointer. The function is not permitted to call any functions from the list module you developed in the labs or any inctions in the C standard library other than a ssert. Your solution must use the walking-pointer technique to traverse the backing array. Marks will be deducted for otherwisecorrect solutions that use another technique. Marks will be deducted for inefcient solutions; that is, solutions that have more loops than are necessary. _Bool list_even_bigger_than_odd (list_t *a_li st) {