Please answer this question. Its from a cryptography course.

27. The following shows the remainders of powers of 10 when divided by 11. We can prove that the pattern will be repeated for higher powers. 101 mod 11--1 100 mod 11=1 102 mod 11 =1 103 mod 11-t-I Using the above information, find the remainder of an integer when divided by 11 Test your method with 631453672