1. Write a recursive algorithm for the n mod m operation without using division that worst case is better than O(n). What complexity is your algorithm? I can think of a couple that involve powers of m, similar to finding a base m representation of n (one is significantly better than the other and I will give extra credit if you figure it out). Using an inductive/recursive proof, demonstrate the correctness of your algorithm.