Algorthim Analysis Question

Create the chart for the extended Euclidean algorithm on the instance of the problem "compute gcd ( 439, 211 ). First work downward, producing a, b, r, and q for each row. Then work back up, filling in the columns for s and t. For the bottom row, which for our RSA work will always have a = 1 and b = 0 (if gcd(0, e) is not 1, then we have to choose a different e), use s = 1 and t 0. Work upward to get the desired s and t for the original values of a and b. = Each time you compute s and t for a row, be sure to check that for the values in that row, sa + tb is equal to the final GCD (which will always be 1 for our RSA work). After doing this, do it again, but this time use s = 1 and t = 1 in the bottom row. Note how the pattern of alternation reverses