Problem 9: Consider the following sequence defined by: U1 = 0 (i.e., first term of sequence U) U2 = 1 (i.e., second term of sequence U) Un = 3 * Un-1 + 2 * Un-2, for n >_ 3 (i.e., nth term of sequence U, where n 3). 1. Write a procedure to compute the value and rank (i.e., value of n) of the first encountered term whose value is greater than or equal to 10000. You should use a stepwise refinement based approach. 2. Provide the corresponding C++ function.