Write a procedure
to store in f the most frequent factor of n, and store in q how many times it appears. If there is a tie, choose the smallest factor. For instance, if called with n = 450 = 21 · 32 · 52, the values after the call must be f =3 and q = 2.
n ≥ 2
Observation You only need to submit the required procedure; your main program will be ignored.