Can you generalize the technique used by heapsort for holding a complete binary tree so that you can store a complete tree of degree d? Given a node’s index p, what are its children’s indices? What is...

Can you generalize the technique used by heapsort for holding a complete binary tree so that you can store a complete tree of degree d? Given a node’s index p, what are its children’s indices? What is its parent’s index?

Write a program that implements quicksort with stacks. (You can use the stacks provided by your programming environment or build your own.)