Q1) In order to determine the priority of who to invite, she uses the formula shown below: priority number = A / 1000 + B C where A is the invitees total distance away from Ms. Fatme

B is the number of years in his or her have been friends with her

C is a sequence number representing the invitees gifts worthiness to ensure good gifts only

Given a file of overbooked invitees as shown in the following table,

You first need to add a method that calculates the priorityNumber inside the Invitee class, and implement the compareTo method.

Then, write a program that reads the file and determines each invitees priority number. The program then builds a priority queue using the priority number and prints a list of waiting invitees in priority sequence.

Notes: for simplicity, this table is given to you in your project as input file: in.txt. Assume the maxSize for this question is 100.

Q2) Write a method IsPathDF (startVertex, endVertex): returns Boolean, that checks if there exists a path from the starting index to the ending index.

Hint: turn the following pseudocode to Java code.

Set boolean found to false Clear all marks Create queue If startVertex == endVertex, return true else

Mark the startVertex Store all adjacent vertices to startVertex in queue do Dequeue adjacent vertex and store in temp if temp is not marked Mark temp Check if there is a path from temp to endVertex while !queue.isEmpty()

return found

Please solve it in java.