with Java

Question 3 Write a method is Sorted() that accepts a stack of integers as a parameter and returns true if the elements in the stack occur in descending order from top to bottom, and returns false otherwise. There's no constraint on the parameters of the method, it's up to you. (Note that if you do not use stack, you will not get any credits, and you should implement stack with a linked list.) Your answer: Question 4 Implement an recursive algorithm that finds the sum of all integers given in an array. (If you do not use recursion, you will not get any. credits.) Solve a recurrence relation for the number of key comparissons made by your algorithm. Find the Big-O complexity. (Show clearly how you have found the complexity to get credits.). Your answer: > >