Study the following pseudocode for a recursive function. function unknown(byval x, byval y : integer) returns integer if x < y then output x + y return (unknown(x + 1, y) * 2) else if x = y then return 1 else output x + y return (unknown(x - 1, y) div 2) endif endif endfunction the operator div returns the integer value after division e.g. 13 div 2 would give 6 (a) write program code to declare the function unknown()
