Consider the following recursive code. // search from a[0] to a[j] for x. if you find it return true; else return false. // bool rec_search(vector & a, int j, int x) { assert(j< =a.); if (j==0) { return (x==a[0]); } if (a[j] == x) return true; return rec_search(a, j-1,x); } give the appropriate recurrence relation for the function rec_search.