#include #include #define MAX_SIZE 100 int count_alphabetical_pairs(int size, char array[MAX_SIZE]); // This is a simple main function which could be used // to test your count_alphabetical_pairs function. // It will not be marked. // Only your count_alphabetical_pairs function will be marked. int main(void) { // This test_array should return 3 due to the following 3 consecutive // alphabetical pairs: // 1. 'a' & 'b' at index 0 and 1 // 2. 'f' & 'g' at index 4 and 5 // 3. 'g' & 'h' at index 5 and 6 char test_array[MAX_SIZE] = {'a', 'b', 'e', 'E', 'f', 'g', 'h'}; // Note: If you modify the above array for your own testing, // you may also need to modify the size variable below accordingly int size = 7; int result = count_alphabetical_pairs(size, test_array); printf("%d\n", result); return 0; } // count_alphabetical_pairs should return the number of consecutive array // elements that are in alphabetical order int count_alphabetical_pairs(int size, char array[MAX_SIZE]) { // PUT YOUR CODE HERE (you must change the next line!) return 42; }