(Solved): Question I (40 pts) Suppose that you have a stack containing N integers. Write a program that repla ...

Question I (40 pts) Suppose that you have a stack containing N integers. Write a program that replaces all odd integers by 0. Question II (60 pts) Let L be a linked list of integers whose values are ordered in ascending order. It can be represented as follows first last 313 10 TH 13 a. Write a method that calculates the number of nodes in L. b. Write a recursive method that allows you to calculate the sum of the values that are in L. c. Write a method that calculates the interval of the list L (difference between the maximum value and the minimum value)