Assignment #3 Recursion and Stack Dec dane Sunday 21 0115 pts] What does the following code fragment presennis 327 Trace the program and show your work to get credit int funl (int) if (1) return 0; else retum 1 ful(2/2): 02[5pts] What does the following code fragment 307 Trace the program and show your work to get full credit stack the wacka while in > 0) puh. 2) Syatem.out.print.pop) System.out.printin 035 pts] Given a non-negative into write and strecursive function sumDigth return the sum of its digits recurvey do not use heations What is the time complexity for your algorithm 04/10 pts) Write an algorithm that uses a stack and maybe more than ones to remove all negative integers without changing the order number What is the time complexity for your sigorithms? Using the following format for an algorithm Algorithm Tile Input Algorithm steps 1 CpE207 Data Structures Fall 21 as | pts] Wite an algorithm that converts a Profession into a Postlia expression using a stack Read the Perfis expression from left to right If the symbol is an operand then push it to the Sack If the symbol is an operative, then pop tweepers the Stack Create a string by catemating the weaped the agenter before them. string operater opererad And push the relating back to Stack Repeat the above Heps til end of Prefixer NH Important Note: 1 Your programs should be well-structures and well-documented. Indicate the expected time complexity of OS and 04 3 You should submit your own code le you are not allowed to copy from the Internet. any other person or references