Prefix Evaluation (unlike postfix described in class) has the evaluation strategy of (operation, data, data]. Whenever such a pattern is encountered, the operation is performed on the two data. For example, + 23 45 Indicates that we are performing the addition operation on the values 23 and 45 (the result is 68). Write a pseudocode to obtain the result of a prefix expression using a queue. Your pseudocode should also determine when invalid prefix syntax has occurred. For the example above, the queue Q will look something like: You may also assume all operations given in question 1 are available to you in the queue ADT