For each one of them:
Turn in a printout of your code and a transcript showing the output produced by your implementation of each function on each of the following inputs: 5, 8, 9, 12.
/ | g(k,m,n), if p(k,m,n)=1 f(k,m,n) := | | h(k,m,n), if p(k,m,n)=0 \where g and h are functions from NxNxN -> N, and p is a function from NxNxN -> {0,1}.
Prove that if g, h, and p are all primitive recursive functions, then f as defined above is also primitive recursive.
Please document your code following the Departmental Documentation Standard, and as part of the documentation, include instructions on compiling, executing, and using your program.
The lastname/extension of this file will depend on the programming language you used (eg. it'll be hw2_prb1.c if you wrote your program in C).