parallel heap sort algorithm   1. Design the parallel pseudo code of heap sort   algorithm by using MPI 2. pseudo code must be simple and elaborated .

Design a sorting algorithm that takes in as input a stack of comparable elements and returns the data in a sorted stack. This stack should have the smallest element as its first element, and the largest element as the top element. The only data structure you can use in this design is a stack structure as we defined in class (i.e. you cannot push all the data into an array, sort that array, and then push that array into the result stack), but you may make use of temporary datapoints and the standard Boolean operations (<, >, <=, >=, ==, !=). These temporary datapoints can include a temp stack. What is the run time of your algorithm?

Discuss briefly on the following below and mention a real-life application : •Priority Queue with Unsorted List•Priority Queue with Sorted List•Selection-Sort•Insertion-Sort

1. "Max-beapitx (create a max-heap from) the following array using the bottom-up, O(n), algorithm. Show the final order in the array. Array: 69 2 1 3 45 Array: