Please use C language(not C++ or Java), write a function blow:

Even-at-even, odd-at-odd a) (10 pts) Write a recursive function that takes as argument an array and its length and returns: a. 1 if the elements at even positions are even and the elements at odd positions are odd (T b. 0- otherwise he number 0 is considered even.) The function must use recursion. You can write auxiliary functions if needed Sample behavior: for [6, 23, 8, 7] it returns because at even positions (0 and 2) we have even numbers (6 and 8) and at odd positions (1 and 3) we have odd numbers (23 and 7) for [6, 23, 5, 7] it returns 0 (because at even index, 2, there is an odd number, 5) for an empty array it returns 1. b) (2 points) Write the recursion formula for your function. c) (2 points) What is the runtime of your function? (No justification needed.)