Write a method LCM() that takes two integers as parameters and outputs the least common multiple of the two integers. That is, given two integers m and n, your method should return the smallest number k divisible by both m and n.
For example, the least common multiple of 3 and 7 is 21 since no smaller integer is divisible by both 3 and 7. However, the least common multiple of 3 and 12 is 12 – this shows that the LCM is not always the product of the two numbers!
