Page of 3 You should print enough test cases below each of your function dentions to be reasonably sure it works for all types of inputs as described in the problem. Your test cases should be different from any of the examples provided in the problem. 1. Write a function is divisible that takes two numbers and as inputs, and that returns True (the Boolean value!) if is divisible by n, and it returns False otherwise. For example, is_divisible(48, 6) should return True, while is_divisible(48,7) should retum False 2. Note: You should finish Number 1 before trying this problem. Recall that a positive integer greater than 1 is called prime if it is only divisible by 1 and itself. Write a function is prime that takes a positive integer greater than 1 as input and that determines whether is prime by testing whether it is divisible by 2,3,4.....1-2, orna 1. The function should return True if n is a prime amber, and False otherwise Your is_prime function mustise your function is divisible from Number 1. For example, in prime(97) should return True, while is_prime (91) should return false Before moving on to the next problems, rocall the following function developed before the tab that prints an nngrid of asterisk def print_shape(n): for i in range(n): for jin range(n): print('.'end = print().calen 3. the need for-loops to write action print shape1 tlust takes a positive integut tid print X u grld of man w below. The act otputs for tandes ench hown below