Data Structures

Using the attached Student and HashEntry classes $($contained in the attached

HashTableAssignment.cs$),$ please provide an implementation for a hash table

class.

Your HashTable class should include:

A method to hash student IDs.

A method to insert a new student record.

A method to search for a student by their student ID$.$

A method to delete a student from the hash table.

Implement a collision resolution strategy, such as linear.

in C#

$```$

public class Student

q$\{$

public string StudentId $\{$ get; $\}$

public string FirstName $\{$ get; set; $\}$

public string LastName $\{$ get; set; $\}$

public int YearInSchool $\{$ get; set; $\}$

public string Major $\{$ get; set; $\}$

public Student$($string id$,$ string firstName, string lastName, int yearInSchool, string major$)$

$\{$

StudentId $=$ id;

FirstName $=$ firstName;

LastName $=$ lastName;

YearInSchool $=$ yearInSchool;

$\}$

Major $=$ major;

$\}$

public class HashEntry

$\{$

public string Key $\{$ get; $\}$

public Student Value $\{$ get; set; $\}$

public HashEntry$($string key, Student value$)$

$\{$

Key $=$ key;

Value $=$ value;

$\}$

$\}$

$```$