Hi there, Would I be able to get help on the below question I have received on my course, Data Structures using C++?

Hi there,

Would I be able to get help on the below question I have received on my course, Data Structures using C++? The below question relates to Stacks, but I'm not too familiar with the process of carrying it out.

The language L = {anbn} where  where n ≥ 1, is a language of all words with the following

properties: 

• The words consist of strings of a's followed by b's.
• The number of b's is equal the number of a's.
• Examples of words that belong to L are: