1. Write an algorithm to determine if a given number (n) is a prime number or not by considering only divisors up to floor (square root of the number n). The algorithm should be step by step such as the example below to find the gcd(m,n)

step 1: Assign the value of min{m,n} to t

step 2: Divide m by t, if the remainder is 0, go to step 3, otherwise go to step 4

step 3: Divide n by t, if the remainder is 0, return t and stop, otherwise go to step 4

step 4: Decrease t by 1 and go to step 2