Multiplication $$ We can also define a multiplication table modulo n in the following way:

For a given fixed integer n and any a$,$ b in Zn$,($a$,$ b $<$ n$)$

$($a mod n$)\backslash$times $($b mod n$)=($a $\backslash$times b$)$ mod n

This allows us to define arithmetic $$modulo n$$ by a $\backslash$times b $($mod n$)=($a $\backslash$times b$)$ mod n$.$

Example: Let n $=5.$

$3\backslash$times $1=3$ mod $5,3\backslash$times $2=1$ mod $5,3\backslash$times $3=4$ mod $5,$ etc.

Write a program that generates the multiplication table modulo n of a given integer n provided as a command line parameter to the program.

For example running: $./$a$1$q$25$

Output:

Multiplication table for Z$5$: $01234$

$000000101234202413303142404321$

Note that the argument n for this program must be provided as a command$-$line parameter. This means you must use parameters in the main function. You also need to notify the user if no parameter is passed.