(1 point) Consider the algorithm: Algorithm Input: Two integers a and b. (1) if a > b then return a, b (2) return b, a What does the algorithm return when the input is a = 8 and b = -49 ? 26 What does the algorithm return when the input is a = 50 and b = 43 ? 26 What does the algorithm return when the input is a = -80 and b = 49 ? 26

Use the inversion algorithm to find the inverse of A = 1 2 3 0 1 2 011

Manually apply the Hungarian algorithm to solve the assignment problem having the following cost table: Assignee A B C D 1 4I3N 1 2 2 1 3 2 2 Task 3 0413 لت ليا ت 0 3 0

Learning Target N2 (Core): I can perform back-substitution in the Euclidean Algorithm to write the the greatest common divisor of a and b as in Bézout's Lemma, gcd(a, b) =as + bt, noting the + between the terms with a, b, s, te Z Use the Euclidean Algorithm with back-substitution to find the gcd (a, b) and then write ged(a, b) = as+bt, noting the between the terms with a, b, s, t € Z. 1. a 36, b= 15. The answer is 3 = 36 (-2) +15 (5), now show the work. 2. a = 567, b = 1234. The answer is 1= 567 (37) +1234(-17), now show the work. I