Using the fact thata mod 7 = (a−7) mod 7, give a recursive algorithm for
computing F(a) = a mod 7.
The input a is a nonnegative integer and the output F(a) is a nonnegative
integer between 0 and 6 (e.g. F(20) = 6).
Write the algorithm as follows: