Define a procedure prime(n), which returns True if n is prime and False otherwise. It’s okay if it’s slow. Your function should have type (positiveInt) -> boolean

def prime(n):
    if (n == 1):
        return True
    else:
        result = True
        i = 2
        while i < n:
            if (n%i != 0):
                result = False
                break
            i+=1
        return result