data structures using these stacksit is important to note one thing--stack will grow from left to rightwhereas stack will grow from right to left at the same time extending this concept to multiple stacksa stack can also be used to represent number of stacks in the same array that isif we have stack[ ]then each stack will be allocated an equal amount of space bounded by indices [iand [ithis is shown in fig [ [ [ [ [ [ [ figure multiple stacks programing example write program to implement multiple stacks #include #include #define max int stack[max],topa=- ,topb=maxvoid pusha(int valif(topa==topb- printf("\ overflow")else topa+ stack[topavalint popa(int valif(topa==- printf("\ underflow")val - else val stack[topa]topa--return valvoid display_stacka(int iif(topa==- printf("\ stack is empty")else for( =topa; >= ; --printf("\ % ",stack[ ])void pushb(int valif(topb- ==topaprintf("\ overflow")else [ [ [