Please write a C program to do this using these two methods:

void readAndCheck(int len);

int main() { }

void readAndCheck(int len) { }

Exercise 2. Super-permutations (30 points) A permutation of the integers from 1 to n is an ordering of these integers. A natural way to represent a permutation is to list the integers in the desired order: For example, for n -5, a permutation might look like 2,3,4, 5, 1. However, there is alternative way of representing a permutation: you create a list of n numbers where the i th number is the position of integer i in the permutation. For the above permutation this alternative representation is 5, 1, 2, 3, 4 since 1 appears on position 5, 2 appears on position 1, and so on (note that in math position numbering starts from 1). A super-permutation is a permutation for which the two representations are identical. For example, 1, 4,3, 2 is a super permutation. You have to write a program which detects if a given permutation is a super-permutation or not. Input: The program should read from the standard input one or more test cases. The first line of each test case contains an integer n (1