Q$1.$ Write two different programs to compute x$^$n mod m $($x$,$n and m are integers$>=0).$

Note that you are not allowed to use $$pow$$ function from library.

The modular operator in both C and Python is $\%.$

$($a$).$ powmod$1($x$,$n$,$m$)$

It computes x$^$n mod m by repeated multiplications, i$.$e$.$ using iteration.