Define two functions to find the greatest common divisor and the least common multip. Requirements: (1) The two integers should be input in the main() function. Report "Input Error" while the input contains negative number. (2) In the main(), call the two functions and output result.