4. Implement the function prototype (in C++) for sequential search below, where a[] is the array to be searched through, t is the target value to be found, n is the array dimension. What is the complexity of the sequential search function? (10 Points) The is complexity is O(n).

int search(int a[], int t, int n){}