Pingu is given two positive integers $m$ and $n$ without any common factors greater than $1$. a) Help Pingu find positive integers $p, q$ such that $$\operatorname{gcd}(pm+q, n) \cdot \operatorname{gcd}(m, pn+q) = mn$$b) Prove to Pingu that he can never find positive integers $r, s$ such that $$\operatorname{lcm}(rm+s, n) \cdot \operatorname{lcm}(m, rn+s) = mn$$regardless of the choice of $m$ and $n$.