(Applications of Matriz Algebra; please study the material entitled "Euclidean Division Algorithm & Matriz Algebra" on the course page beforehand). Find the greatest common divisor d = gcd(a, b) of a = 576 and b= 233, and then find integer numbers u, v satisfying d=ua + vb by realizing the following plan: (i) perform the Euclidean division algorithm to find d, fix all your division results; (ii) rewrite the division results from (i) by means of the matrix algebra; (iii) use (ii) to find a 2 x 2 matrix D with integer entries such that D() = (d). thereby obtaining the required integers u, v. Present your answers to the problem in a table similar to the following table: Subproblem | Answer(s) (i) 525231 2+63, 231 = 63 3+ 42, 6342 1+21 42 = 21.2; Consequently, d = gcd(525, 231) = 21. 1 525 231 (ii) -2 231 63 1 231 BE -3, 63 1 63 -1 42 1 42 -2) 21 = (iii) By (ii), 525 (2) G (Y6 Y6 Y6 -¹2) (2²) = (?). 231 D whence D= and then 4-525-9-231 = 21, 25 or u = 4 and v=-9, as required. (63 42 42 21