Assume that n is represented in unary notation: namely, the string that represents n is 1" (the string of n ones.) In this representation, produce a (possibly multi-tape machine) which decides if a given input is PRIME in time O(n2). The key to solving this is to understand how to check divisibility of one integer by another, if they are both given in unary notation. Assume that n is represented in unary notation: namely, the string that represents n is 1" (the string of n ones.) In this representation, produce a (possibly multi-tape machine) which decides if a given input is PRIME in time O(n2). The key to solving this is to understand how to check divisibility of one integer by another, if they are both given in unary notation