Please answer this Discrete Mathematics question. Please show all steps for (a) and (b) and the proofs for each.

1 Square roots. again Dene the predicate IsSquaxeRoot($, y) to mean :1: 2 0 and a: - a: = y. a) Prove that if IsSquareRoot(a;, 'r) and IsSquareRoot (y, s) then IsSquareRoot(:1:y, rs). b) Prove that IsSquareRoot(:c, r) and IsSquareRoot(y, 1') implies that a: = y. (This is like saying that every number has at most one positive square root.) Remember that in this class, we don't know what the notation J57: or $1\" you should not write those anywhere in your proofs. means, SO