This question is based on the assignment on hash.

struct node

$\{$ int num;

int freq; $//$number of times the given num has occurred

node $*$next;

$\}$;

class hash$\_$array

$\{$ node $*$ begin;

public:

hash$\_$array$()$;

void insert$($int $n)$;

$\}$

Using the above declaration you need to write the following

a$)$ insert function $-$ Traverse the linked list. If you find the "num" existing increase the frequency else add the "num" at the end of linked list.

b$)$ main function $-$ Declare the array, read an integer, generate the hash key, and call the insert function.