11. The greatest common deuxsor of two positive integers is defined in Example 2. Leta and b be positive integers and their GCD. It is always possible to find two integers and t such that sa t*b = Write a cursive Python function, GCD2, based on GCD (Figure 2.9) Ho that GCD2(,) returns a list of three numbers: (.t] having the property that is the GCD of and b, and s* a tb = . Note thats and do not have to be positive. Be sure to include some large integer in your test runs. Your program must une recursioni intelligently and should not just une recursion to search through all possible pairs of integers (st)