Choose the right data structure to implement for the following application:Checking whether you have a matched open and close parentheses (brackets) in your program.AStackBQueueCLinkedListDNo data structure is implemented

The correct data structure to implement for this application is AStack.

Here's why:

Step 1: Understanding the problem The problem is to check whether every open parenthesis (bracket) in a program has a corresponding close parenthesis. This is a common problem in compilers and text editors.

Step 2: Analyzing the options A. Stack: A stack is a Last-In-First-Out (LIFO) data structure. This means the last element added to the stack will be the first one to be removed. This property makes it a good candidate for this problem. B. Queue: A queue is a First-In-First-Out (FIFO) data structure. This means the first element added to the queue will be the first one to be removed. This property does not fit the problem. C. LinkedList: A linked list is a linear data structure where each element is a separate object. Each element (node) of a list is comprising of two items - the data and a reference to the next node. It is not suitable for this problem. D. No data structure is implemented: This option is not suitable because a data structure is needed to solve this problem.

Step 3: Choosing the right data structure A stack is the right data structure to use for this problem. You can push each open parenthesis onto the stack when you encounter them in the program. When you encounter a close parenthesis, you can pop an open parenthesis from the stack. If the stack is empty when you encounter a close parenthesis, or if there is an open parenthesis left on the stack when you have checked the entire program, then the parentheses are not properly matched.