Write and run a C program that performs the following: o Create two arrays of charecters each of size 100 o prompts the user to enter 2 strings and store them in the two character arrays o Passes the second string to a recursive user defined function named recursive_non_vowels_count that takes an input parameter of type char* (null-terminated C strings of characters). The size of the input string is not passed as parameter.The function should return number of non-vowels in the string recursively. o Print the number of non-vowels (from inside the main) o Write a C function named IsSuffix that takes two input parameters ShortS and LongS of type char* (null-terminated C strings of characters) and determines if ShortS is a suffix of LongS ( ). If ShortS is a suffix of LongS , the function returns 1; otherwise, it returns 0. The sizes of the input strings are not passed as parameters. Assume that ShortS is guaranteed to be shorter than LongS . For example, if LongS is C_programming_is_good and ShortS is good or ood, the function should return 1, while if ShortS is Cprog or programming or fun, the function should return 0. o In the main function, pass any two string to the function IsSuffix such that the first string is smaller than the second one, and print the result return by the function.