ey puppy Computing div and mod. procedure division algorithm(a: integer, d: positive integer) 9:=0 r := = lal while r d r :=r-d q:= q + 1 if a < 0 and r> 0 then r := d-r bom (599 q:= -(q + 1) return (q, r) {q = a div d is the quotient, r = a mod d is the remainder}