Let B = {a#b#c | a, b, c are binary numbers, i.e., strings over {0,1}, and a*b=c, where * is the multiplication operator}. If B is a context free language, then build the corresponding PDA. If not, prove that B is not a context-free language using the pumping lemma.