Question 3 4 Points Let a and b be integers. If 7|(19a +29b), prove that 7|(12a + 8b) Use the editor to format your answer Question 4 14 Points Let a, = 1, an=-an-1 + 2 be the recurrence relation of algorithm A and T(1) = 1, T(n) = T(1/3)+n be the recurrence relation of algorithm B. 1. Find the solution for both relations. Use any method. 2. Without proof, find Big-Oh for both algorithms. Use any method. 3. Which algorithm is faster? Justify your answer using Big-Oh notation. Use the editor to format your