Statement: Given a sequence of non-negative integers, where each number is written in a separate line. The sequence ends with 0. Print the index of the maximum of the sequence. Programming Tasks:
(1) Prompt the user to continuously input integers until 0
(2) Output to the screen the maximum of the sequence
Еxample IO: Iпрut:
1
7
9
5
0
Оutput: 3

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is