Create the structure employee with int Id$,$ char name $50,$ ILoat salary and int numberOrDependents as fields. The employee id is the sum of the asci codes of the uppercase of the letters of the name, including white spaces in the name. For example, if the name is AaBc xYa then:

$id=$ ascii $ofA+$ ascii $ofA+$ ascii $ofB+$ ascii $ofC+32+$ ascii $ofofx+$ asci $ofY+$ ascil $ofZ$

$=562$

The goal of this HW is to create a special linked list that you may call company to store the employees. We seek to implement a list that can be pictured as:

Let emp$1$ and emp$2$ and emp$3$ be three different employee variables to add to coapany in this order, and assume that Aidan Jones, Nadia Jones and Naadi Jones are the names of those employees. Those employees have the same emplovee id$,$ and in this collision case, we first add Aldan to the list then Nadia and then Naadi are to be added to a new linked list as seen in the picture above.

Consequently, each node of canpany should contain twy porters that you may call next and below. The cots in the picture above denote the NULL pointer.

Your job is to write the code that allows to:

Print all the employees

Add a new employee

Search an employee by name. Your code prints Found$/$Not Found to the screen

Find the highest net salary