7. Given a target value t and an integer array a that has n number of elements, complete the sequential search function below that search through a to find 1. The function returns the index of the target value if it is found in a, or return -1 if there is no target found. (10 Points) int search(int a[], int t, int n); 8. Implement the array-based template circular queue class. The class should have all necessary data member and function members: pointer to storage, size of storage, head and tail position, hold value, constructor and destructor, empty and full judgement, append and remove operations, etc. (30 Points)