Answer 1

for hcf: you could write a code that checks for every number (k) lower than the smallest of two numbers (m,n) if m%k == 0 and n%k ==0
for lcm: the code is almost the same: you should try to find the smallest number k where k%m==0 and k%n==0