Use class that I provided below.

You ARE NOT ALLOWED to use any data structure or algorithm related function from the C$++$ standard template library $($STL$)$ or any other external libraries.

Main method MUST be in Subtask$1.$cpp class

#ifndef HOMEWORK$3\_$HASHTABLE$\_$H

#define HOMEWORK$3\_$HASHTABLE$\_$H

#include

#include

class HashTable $\{$

private:

public:

HashTable$()$;

~HashTable$()$;

void insert$($const std::string& key$)$;

bool search$($const std::string& key$)$;

static const int TABLE$\_$SIZE $=100$;

struct Node $\{$

std::string key;

Node$*$ next;

Node$($const std::string& key$)$ : key$($key$),$ next$($nullptr$)\{\}$

$\}$;

Node$*$ table$[$TABLE$\_$SIZE$]$;

$\}$;

#endif

$//$HashTable$.$cpp class

#include "HashTable.h$"$

HashTable::HashTable$()\{$

for $($int i $=0$; i $$ TABLE$\_$SIZE; $++$i$)\{$

table$[$i$]=$ nullptr;

$\}$

$\}$

HashTable::~HashTable$()\{$

for $($int i $=0$; i $$ TABLE$\_$SIZE; $++$i$)\{$

Node$*$ current $=$ table$[$i$]$;

while $($current $!=$ nullptr$)\{$

Node$*$ temp $=$ current;

current $=$ current$->$next;

delete temp;

$\}$

$\}$

$\}$

void HashTable::insert$($const std::string& key$)\{$

int hash $=0$;

for $($char c : key$)\{$

hash $=($hash $*256+$ c$)\%$ TABLE$\_$SIZE;

$\}$

Node$*$ newNode $=$ new Node$($key$)$;

newNode$->$next $=$ table$[$hash$]$;

table$[$hash$]=$ newNode;

$\}$

bool HashTable::search$($const std::string& key$)\{$

int hash $=0$;

for $($char c : key$)\{$

hash $=($hash $*256+$ c$)\%$ TABLE$\_$SIZE;

$\}$

Node$*$ current $=$ table$[$hash$]$;

while $($current $!=$ nullptr$)\{$

if $($current$->$key $==$ key$)\{$

return true;

$\}$

current $=$ current$->$next;

$\}$

return false;

$\}$