Draw the recursion tree that results from calling BCD(75, 42)? public Integer BCD(a, b : Integer) { if (b == 0) Return a; else { c = a % b ; // % Rest of division return BCD(b, c) } }