State Whether the given statement are TRUE OR FALSE. 13X1=13 23] The result of any condition is true ,false or unknown.

24] The WHILE and UNTIL can be placed at the end of DO….LOOP.

25] When a program contains a loop , it means it can repeat statements only

once.

26] The first version of visual basic was VB. Net

`27] The name of the form 1 dialog box which appears by default can be

changed .

28] The Error window opens when there are some coding mistakes.

29] E. F Codd proposed the first type of relational database model.

30] there is a way to rename the tables in Access.

31] One row will have one unit of complete information .

32] The text can be only numerical

33] currencies cannot be stored in Access

34] A number of list items go within the <ul> tags give right​

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)