Help me fix code in C$++$ All errors occur in main: #include

#include

#include

#include

template

class Table $\{$

public:

static const std::size$\_$t CAPACITY $=811$;

Table$()$ : used$(0)\{\}$

void insert$($const RecordType& entry$)$;

void remove$($int key$)$;

bool isPresent$($int key$)$ const;

void find$($int key, bool& found, RecordType& result, std::function hashingFunction $=$ findIndex$)$ const;

std::size$\_$t size$()$ const $\{$ return used; $\}$

private:

static const int NEVERUSED $=-1$;

static const int PREVIOUSLYUSED $=-2$;

RecordType data$[$CAPACITY$]$;

std::size$\_$t used;

std::size$\_$t hash$($int key$)$ const;

std::size$\_$t nextIndex$($std::size$\_$t index$)$ const;

void findIndex$($int key, bool& found, std::size$\_$t& i$)$ const;

bool neverUsed$($std::size$\_$t index$)$ const;

bool isVacant$($std::size$\_$t index$)$ const;

static void quadraticProbe$($int key, bool& found, std::size$\_$t& i$,$ const Table$*$ table$)$;

static void secondHash$($int key, bool& found, std::size$\_$t& i$,$ const Table$*$ table$)$;

$\}$;

template

void Table::insert$($const RecordType& entry$)\{$

bool alreadyPresent;

std::size$\_$t index;

assert$($entry$.$key $>=0)$;

find$($entry$.$key, alreadyPresent, index$)$;

if $(!$alreadyPresent$)\{$

assert$($size$()$ CAPACITY$)$;

index $=$ hash$($entry$.$key$)$;

while $(!$isVacant$($index$))\{$

index $=$ nextIndex$($index$)$;

$\}$

$++$used;

$\}$

data$[$index$]=$ entry;

$\}$

template

void Table::remove$($int key$)\{$

bool found;

std::size$\_$t index;

assert$($key $>=0)$;

find$($key$,$ found, index$)$;

if $($found$)\{$

data$[$index$].$key $=$ PREVIOUSLYUSED;

$--$used;

$\}$

$\}$

template

void Table::find$($int key, bool& found, RecordType& result, std::function hashingFunction$)$ const $\{$

std::size$\_$t index;

hashingFunction$($key$,$ found, index$)$;

if $($found$)\{$

result $=$ data$[$index$]$;

$\}$

$\}$

template

std::size$\_$t Table::hash$($int key$)$ const $\{$

return key $\%$ CAPACITY;

$\}$

template

std::size$\_$t Table::nextIndex$($std::size$\_$t index$)$ const $\{$

return $($index $+1)\%$ CAPACITY;

$\}$

template

void Table::findIndex$($int key, bool& found, std::size$\_$t& i$)$ const $\{$

std::size$\_$t count $=0$;

i $=$ hash$($key$)$;

while $(($count $$ CAPACITY$)$ && $(!$neverUsed$($i$))$ && $($data$[$i$].$key $!=$ key$))\{$

$++$count;

i $=$ nextIndex$($i$)$;

$\}$

found $=($data$[$i$].$key $==$ key$)$;

$\}$

template

bool Table::neverUsed$($std::size$\_$t index$)$ const $\{$

return data$[$index$].$key $==$ NEVERUSED;

$\}$

template

bool Table::isVacant$($std::size$\_$t index$)$ const $\{$

return $($data$[$index$].$key $==$ NEVERUSED $||$ data$[$index$].$key $==$ PREVIOUSLYUSED$)$;

$\}$

template

void Table::quadraticProbe$($int key, bool& found, std::size$\_$t& i$,$ const Table$*$ table$)\{$

std::size$\_$t count $=0$;

i $=$ table$->$hash$($key$)$;

while $(($count $$ CAPACITY$)$ && $(!$table$->$neverUsed$($i$))$ && $($table$->$data$[$i$].$key $!=$ key$))\{$

$++$count;

i $=($table$->$hash$($key$)+$ count $*$ count$)\%$ CAPACITY;

$\}$

found $=($table$->$data$[$i$].$key $==$ key$)$;

$\}$

template

void Table::secondHash$($int key, bool& found, std::size$\_$t& i$,$ const Table$*$ table$)\{$

std::size$\_$t count $=0$;

i $=$ table$->$hash$($key$)$;

while $(($count $$ CAPACITY$)$ && $(!$table$->$neverUsed$($i$))$ && $($table$->$data$[$i$].$key $!=$ key$))\{$

$++$count;

i $=($i $+7-($key $\%7))\%$ CAPACITY;

$\}$

found $=($table$->$data$[$i$].$key $==$ key$)$;

$\}$

int main$()$

$\{$

Table table;

bool found;

RecordType result;

int key $=5$;

table.find$($key$,$ found, result, std::bind$($&Table::quadraticProbe, std::placeholders::$\_1,$ std::placeholders::$\_2,$ std::placeholders::$\_3,$ &table$))$;

table.find$($key$,$ found, result, std::bind$($&Table::secondHash$,$ std::placeholders::$\_1,$ std::placeholders::$\_2,$ std::placeholders::$\_3,$ &table$))$;

$\}$