PLease do all 3 problems!!.Thanks!

1.Write a recursive method and show the stack trace which will send in a positive integer and return the sum (example sum(5) would return 15 (5+4+3+2+1). ON PAPER

2.Here is the infix notation: 4+3*(6*3-12): ON PAPER

What is the maximum number of symbols that will appear on the stack at any given time?

What is the postfix

Draw the tree

3.*Consider the following pseudo code:

Declare an empty stack of characters

While(there are more characters to read)

{

Read a character

Push the character on to the stack

}

While(the stack is not empty)

{

Write the stacks top character to the screen

Pop a character off the stack }

What is written to the screen for the input : carpets

Same question 3 in picture as i have:

PLease do all 3 problems!!.Thanks!

49. Consider the following pseudo code: Declare an empty stack of characters While(there are more characters to read) Read a character Push the character on to the stack While(the stack is not empty Write the stacks top character to the screen Pop a character off the stack What is written to the screen for the input: "carpets