Implement a Set using a fixed$-$size array and following the interface shown below.

template etypenane It

struct set $($

$T=$ Ittens?

f:

int count:

tomplate ctypename $T,$ void initialixe$($Setcty Bset, int max$)$ ;

template ctypename $T$ void destroy$($Setcris Bset$)$

template stypenane $T)$ void insert$($Setsts iset, $T$ iten$)$ ;

terplate etypenane th bool contains$($Setets iset, T itca$)$;

The pointer items should reference a dynamic array holding the members currently in the Set. The integer count should indicate the number of members currently in the Set.

initialize$()$ sets up the data structure and allocates an array of size max

destroy$()$ cleans up the before Set goes out of scope

insert$()$ includes item as member of the Set

remove$()$ excludes iten from being a member of the Set

contains$()$ reports whether item is currently a member of the Set

size$()$ reports the current size $($cardinality$)$ of the Set

You can test your code using something like the following code. Obviously you should expand the following to fully test your code.

sinclude elostrean?

ainclude sicassert?

Einclude "your$\_$header, $h=$

using nanespace sitd;

int can$()$

i

setcints $:

initialize $(s,10e)$ i

assert$($size $(s)=$ e$)$;

insert $(5,42)?$

askert $(size(x)-1)$ :

asuert contains $(5,1)?$

as wert $($contains $(5,42))$;

for $($int i$-$fi; ikse; int$)$

s$.$ insert $(s,i)$;

assert $($size $(3)-50$ i

for $($int $1-$e; liclee; it$-3)$

rewave $(s,i)$ :

as sert $($centains $(5,1))$ ;

destary$($s$)$ :