Euclidean Algorithm to find god(A,B) : a := A, b: = B, r := B while (b + O) r := a mod b a := b b = r. end while god := a output god Make a trace table to trace the action of the Euclidean algorithm to find the greatest common divisor of 105 and 60. Show all of your work. CS Scanned with CamScanner