I'd like to see the correct answer. Question #4 (30 points). Provide clear, concise answers to each of the following questions concerning the following code to perform a linear search through an input array: Linear-Search (A, low, high, item) found index forlow to high it AI-item found indexi return (found index) (20 points.) Carefully prove each clause of the following loop invariant: (10 points). if (item Aow,then (found.indez o) -(10 points). if (item E Allow : 1-1), then (item = alfound-index)) (10 points). Prove the correctness of Linear-search ( )