You are required to implement hash table with size 100, where collision should be resolved through separate chaining.

Create a class of patient with following attributes

Patient Name

Age

NIC(Numeric)

Patient ID(Numeric).

Each index of the hash table should be mapped with the hash key of the Patient ID. The hash function should be modulus based (as explained in lecture). User should be given following choices i.e.,

Add New Record

Search Existing Record(by patient id)

Delete Existing Record(by patient id)

Show all records.

In order to compute all the operations, number of computations required to complete the task should be shown as well.