Write a function which sorts the stack in order from the largest value to the smallest value. this should be a modified version of bubble sort. 2. write a function which prints the values in the stack in reverse order. 3. write a function which the counts the number of odd numbers and even numbers currently in the stack and prints the results. optional 4. write a function which prints how many numbers in the stack are divisible by 2,3, and 5. part 2 (queue) 1. write a function which sorts the queue in order from the smallest value to the largest value. this should be a modified version of bubble sort. 2. write a function which adds a value to the queue in the correct position (numbers are arranged from the smallest value to the largest value). 3. write a function which prints the median and mean of the queue. take some time to consider all the required conditions to calculate the median of a dataset. optional 4. write a function which prints the mode of the queue. (the number which appears the most frequently in the queue) part 3 (link list) 1. write a function which adds 4 to all the even values in the link list and multiples all the odd values by 5. 2. write a function which multiplies the values in odd position values by 10. odd positions in this case refers to the first value in the list, the third value, the fifth value etc. 3. write a function which determines if the values in the queue is divisible by 5 or 10 if true the value is divided by 5. optional 4. write a function which prints all the prime values in the queue part 4 1. trace each demo program by hand using the table from your midterm exam for stacks and queues.