SOLUTION NEEDED ACCORDING TO C LANGUAGE ONLY ! ! ASAP

1. Write a program in C which takes an integer 'n' (n [4,100]) from a user. This is the size of a one dimensional array (Say A). Now fill the values of the array with random numbers strictly using random number generation via srand. Now find the longest subsequence in the array which contains alternative greater than and smaller than elements i.e. elements having following sequence: a>df... (Alternate greater than and smaller than values) ac 3 1 is the largest subsequence having alternate pattern) Output: Longest subsequence is 5, 7, 3, 10, 1 of length 5 [10]