Problem:
Question 1: Write a method that returns the sum of all the elements of an array of ints that have an odd index.
Question 2: Draw tree representation for the prefix expression:
a) *a+b*c+de
b) *a+*b+cde
Question 3: convert the expression ((a+b) + c * (d+e) + f) * (g+h) to a:
a) prefix expression
b) postfix expression
Please describe step by step.