write a code in c# that
Given a text, we need to look up the longest valid infix expression in the text and return its evaluation.

The following expressions are a valid infix expressions:

* a
* a+b
* (a/b)
* (a + b) + (c) * a /c

Input example:

* “abcd 6 (4+3)*9yuy 6*((4+2)-(8-2))”

Output:

* 6 * ( ( 4 + 2 ) – ( 8 – 2 ) )
* result : 0.
....................................................
use stack and queu