/***************************************************************************** Asgn-5 Due NLT: Midnight 4/3/05 Write a C++ program that uses a stack to test for balanced bracket pairs. Your stack MUST be created using an arraybased stack implementation. Input strings will be read from the standard input. These input strings, all consisting of a single line less than 80 characters long, will include four types of bracket pairs: {}, [], <>, () In order for an expression to be bracketed properly, each left bracket must be matched with a corresponding right bracket in the proper sequence. For example the expression {A{B(E)F}(G)} is correct, but {A[B}] Your program must continue to read strings and indicate whether they are properly bracketed until it gets an input string starting with a period ("."), at which point execution will terminate. Do not impose any additional requirements on the user. Ensure that your program is developed with the principals of quality software in mind. Use the sile name asgn-5.cpp to store your application source, and submit required files as an email attachment to arrive no later than the due date posted above. *****************************************************************************/