pls help

Algorithm1.1 Sequential Search, Unordered Input: E,n,K, where E is an array with n entries (indexed 0,,n1 ), and K is the item sought. For simplicity, we assume that K and the entries of E are integers, as is n. Output: Returns ans, the location of K in E ( 1 if K is not found). int seqSearch(int[]E, int n, int K ) 1. int ans, index; 2. ans =1;// Assume failure. 3. for (index =0; index <>