You need to write the code in java. Consider a post office that sells stamps in three different denominations, 10p, 7p, and 1p. Write a recursive function that calculates and returns the minimum...

No plagarism!

Correct and detailed answer ( code with comments and output screenshot if necessary)

Extracted text: You need to write the code in java. Consider a post office that sells stamps in three different denominations, 10p, 7p, and 1p. Write a recursive function that calculates and returns the minimum number of stamps necessary for a postage value of N pence. What is the running time of your algorithm?