Suppose A0= 1, A1=1 and an = 3A(n1) 2A(n2) for n 2. Use the well-ordering principle to prove that an = 1 for all n. You need to write an elegant and complete proof. Clearly mark all important parts of the proof.