Question

Language: C++ PLEASE INCLUDE SCREENSHOT OF OUTPUT

In this assignment, you will consider the problem of organizing a collection of computer user-ids and passwords. Each time a user logs in to the system by entering his or her user-id and a secret password, the system must check the validity of this user-id and password to verify that this is a legitimate user.

Because this validation must be done many times each day, it is necessary to structure this information in such a way that it can be searched rapidly. Moreover, this must be a dynamic structure because new users are regularly added to the system and some users deleted from the system.

Upon execution of your program, it should first read the user-ids and passwords from a file and create a hash using the user-id as a key (assume unique user-ids for convenience). Note: Initially it will be empty.

Once the hash has been built, it should display the following menu:

(1) Add new user

(2) Delete user

(3) Verify user

(4) Print users

(5) Quit

Option (1) and (2) simply add/delete new/existing users.

When option (3) is selected, the user is supposed to enter a user-id and a password.

Then, you should search the tree and a print message like "Valid User" or "Invalid User".

When option (4) is selected, the users and their passwords should be printed out in alphabetical order.

Finally, when option (5) is selected, the elements of hash should be stored to a file and execution should be terminated.

Answer 1

# dekhe 512E 30 struct Uselem cha deta o]

2) ese ++hasんIndex ro NULL;

flem) ULL dae en. +hashnde; ent o 21-7

else lat meRn ) lo' Corront em ← FILE PP ved, ddte

Sulleh (h) Case: Case 2 dalete (Ham) else Case 3

else pintR("Tnvald use "); Case Ч; Case 5