Write a program that reads and stores the names of persons and the names of job positions in the vertices of a graph.
Two vertices will be connected if one of them represents a person and the other a job position for which that person is qualified.
The program should allow the user to specify one of the following options:
a. Insert (a) a new applicant or (b) a new job position into the graph.
b. Delete (a) an applicant or (b) a job position from the graph.
c. List all persons qualified for a specified job position.
d. List all job positions for which a specified person is qualified. Use the functions developed in Problems 7-10 to implement these operations.