int hasRepeatedPrimeFactors $($unsigned long long n $)$;

that returns $1$ if $n$ contains any prime factor more than once, or $0$ if $n$ contains its prime

factors exactly once. Assume $n2.$ Do this using loops, without recursion. $($The

parameter is declared as long long rather than int to maximize the size of numbers the

function can handle.$)$