Describe the design procedure including the flow chart and pseudo code before your programming. Following the design spec, you should accomplish it in C Language. Attach your full code and the demonstration. Write a complete C function named is Symmetric, the prototype of which is given below, that returns the Boolean value true if the elements of an array of integers named values of size n (specified as a parameter) are symmetric around the middle. If the array elements are not symmetric, the function should return false. Both the array and its size are specified as parameters. An array values of size n is symmetric if values[0] is equal to values[n-1], values[1] is equal to values[n-2], and so on. For example, the elements in the following array are symmetric: int list1[] = {1, 4, 5, 4, 1}; The elements in the following array are not symmetric: int list2[] = {4, 6, 8, 9, 9, 8, 5, 4}; Write a C program to sort an array using Bubble Sort. struct Inode { int data: struct Inode "next; }"head:/' preform a bubble sort on the linked list'/void IK st_b u bble_sort(void) { struct Inode "a = NULL: struct Inode "b = NULL: struct Inode "c = NULL; struct Inode "e = NULL: struct Inode tmp = NULL: I' II the 'c' node precedes the 'a' and 'e' node II pointing up the node to which the comparisons II are being made. I' while(e != head- > next) { Write a C program that performs a bubble sort on the linked list void main() { int array{MAXSIZE]; int i. j. num, temp: printf("Enter the value of num "): scanf("%d". &num): printfCEnter the elements one by one "): for (i = 0: i