$1.(10\%)$ Modular Arithmetic $$ For a positive fixed integer n$,$ we define a mod n as

the remainder of a when divided by n$.$ Note that a mod n always yields a number

less than n$.$ C language uses $\%$ to denote mod, i$.$e$.$ a $\%$ b means a mod b$.$ Create

a program that runs four loops, separating outputs by a blank line. The loops

should start in i$=0$ until $100$ and print all values i mod n where n equals $5,10,27$

or $100.$

For example, the loop for n$=5$ will look like this:

for$($i $=0$; i $<100$; i $=$ i $+1)$

printf$("\%$d$,",$ i$\%5)$;

Output $($partial$)$:

$0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,0,...$

Write the other loops for n equals $10,27$ and $100.$