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

teaplate ctypenane its

struct set $f$

in itens;

$1$;

int count;

template ctypenane $T$ veid indtialize$($Seters aset, int max$)$:

template ctypenane T$,$ veid destroy $($SeteT$,$ sset$)$

teeplate etypenane T$)$ void insert $($Sete Ts sset, T iten$)$;

terplate etypenane Tr void renove$($SeteT$,$ Bset, T iten$)$;

tenplate stypenane T$,$ beol contains$($Setets Aset, T iten$)$;

terplate etypenane T$)$ int size$($Seterts Aset$)$;

The pointer itens 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.