Question $1.$ Find gcd$(88,42)$ by applying the following algorithms:

a$)$ Consecutive integer checking algorithm $($stop at the end of the fourth cycle$).$

b$)$ Euclid$$s algorithm $($show all steps$).$

c$)$ Middle$-$school procedure algorithm $($show all steps$).$

Question $2.$ Use Sieve of Eratosthenes algorithm to list all primes less than or equal to $30($show all steps$).$