Implement the perfect hashed data structure discussed in this chapter and provide an application that demonstrates that its four basic operation methods function properly. Your application should store nodes for a ticket application for the Green Community Theater. The Green Community Theater uses the following seating chart:

Each ticket has a number. The lowest ticket number is 1000. The ticket also has the section number, row number, seat number, name and date of the event. The ticket number will be the key field and the nodes will also store the purchaser's name and the other information about the ticket. The same ticket numbers are reused for different events and dates, you should have your structure designed so that a new instance would be required for another event and date.

Note: The relationship between ticket number and section, row, and seat number is fixed and you be able to map given either.

Green Community Theater Seating Chart Section 1 Section 2 Section 3 Section 4 Rows A to Y RowsA toY Rows A to Y RowsAtoY 5 se ats perrow 10 seats per row 10 seats per row 5 se ats perrow Green Community Theater Seating Chart Section 1 Section 2 Section 3 Section 4 Rows A to Y RowsA toY Rows A to Y RowsAtoY 5 se ats perrow 10 seats per row 10 seats per row 5 se ats perrow