Question $5$: $[3$ marks$]$ Using Stack both functions push$()$ and pop$().$ Implement the Boolean function

is$\_$palindrome, that takes and array of characters then returns true if the characters are palindrome e$.$g$.$

${\{}^{\text{'}}{m}^{\text{'}},{?}^{\text{'}}{a}^{\text{'}},{?}^{\text{'}}{d}^{\text{'}},{?}^{\text{'}}{a}^{\text{'}},{?}^{\text{'}}{m}^{\text{'}}\}$ and false if it is not, e$.$g$.{\{}^{\text{'}}{m}^{\text{'}},a^{\text{'}},{?}^{\text{'}}{d}^{\text{'}},{?}^{\text{'}}{a}^{\text{'}},{?}^{\text{'}}{r}^{\text{'}}\}.$

bool is$\_$palindrome$($char word$[],$ int size$)$

note:

$1-$ The implementation must include push$()$ and pop$()$ function for at least half of the elements in

array word$[]$ to be considered for partial marks.

$2-$ You need to declare StackArray