Create a C# program using WINDOWS FORM App in Visual Studio. THE ANSWER MUST BE IN C#, IN WINDOW FORM APP, IN VISUAL STUDIOS.

Write the code to:

• Remove all duplicates from an unsorted linked list
• Use a stack to check if an expression contains a balanced parentheses

When we say parentheses we mean ( ) { } [ ]

An expression may contains just ( ), or { }, or [ ]

However, some expressions may contain a combination of 2 or more types

Example a nested for loop inside a method

private double GetAvg(int[,] array)

{

for(int i=0; i

{

for(int j=0; j

{

}

}

return 0;

}

Use a stack to help you find out if all these parentheses are balanced

No missing parentheses of any kind and no extra ones of any kind.

Your code can ignore anything that is not a parentheses character

Push any ( { [ to a stack and when it sees a closing parenthesis it should be matched with the one on top of the stack.

orders of {,},(,),[,] are correct in exp. For example, the program should print true for exp = [()]{}{[()()]()} and false for exp = [(])