Write a Java program to simulate Priority-Queue and Heap

The Programing should include these program.

While () {

Generate a Random number (1~100);

add the number into your heap tree;

Modify the heap tree;

Print out array myArray[0]~myArray[30];

} // total 30 numbers

While( not empty) {

remove max/min vlaue

Modify the heap tree;

Print out array myArray[0]~myArray[30];

}

Please write programing follow this question.