please solve this in c++(acc to DSA) , it's very urgent, solve it immediately. please very very urgent.

Consider a doubly linked list (DLL) with four nodes with data values: a,b,x, and c. What steps need to be followed in sequence to delete a particular node (say x ) from the given list? Write a function: int DeleteNode(double x ) to delete node x from the linked list given above. Using the operator stack, convert the following Infix expression to a Postfix expression by maintaining a table consisting of entries corresponding to - Current Symbol, Operator Stack, and Postfix String. The table should contain the entries corresponding to the stepwise evaluation of the procedure. Also, find out the maximum size of the operator stack during the evaluation. Given Infix Expression: a+bc(de+f)/gh