Question $1[10]$ setting up$.$Code must be in java.Please follow each instruction

Study the class definitions below:

class Node

$\{$

$//$ attributes

String flight$\_$no; $//$ flight number

Date arrival$\_$time; $//$ time at which flight lands

class PriorityQueue

$\{$

$//$ attributes

int currentSize;

Node root;

FlightNode$[]$ array $=$ new Node $[25]$;

$//$ methods

void clear$()$;

Boolean isEmpty$()$;

Boolean add$($Node x$)$;

Node remove$()$;

void percolateDown$($int hole$)$;

$\}$

$1\mathrm{.}1$ Create two files Node.java and PriorityQueue.java

$1\mathrm{.}2$ Copy the above definitions into the corresponding files

$1\mathrm{.}3$ Write code for a default and a loaded constructor for Node

$1\mathrm{.}4$ Write code for a default and a loaded constructor for PriorityQueue

$1\mathrm{.}5$ Write accessor and mutator methods for the attributes of Node

$1\mathrm{.}6$ Write accessor and mutator methods for the attributes of PriorityQueue

Question $2[20]$ adding functionality

Extend the PriorityQueue class:

$2\mathrm{.}1$ Write code for the method void clear$()$ which empties the heap and resets the

size to $0.$

$2\mathrm{.}2$ Write code for the method Boolean isEmpty $()$ that checks whether the heap

contains any elements or not.

$2\mathrm{.}3$ Write code for the method Boolean add$($Node x$)$ which adds a new node to

the heap

$2\mathrm{.}4$ Write code for the method Node remove$()$which deletes the root, decreases the

heap size and reorders the remaining heap. It should involve a call to a method

percolateDown$($int hole$).$