Say we have the pseudo-code for a Euclid algorithm: c -EUCLID (a, b) Inputs a, b : integers vith a - bo, and a !-0. Outputs dgcd(a,b) while (v > 0) r-u mod v d-u Consider the case in which the inputs a and b are coprime and have equal lengths n. Construct a simple best-case example for which the computing time of EUCLID is smallest possible, that is O(n