TASK 1 – Work out the cost. The cost of the trip for each student is a share of the cost of a coach plus the cost of entry to the theme park.
The total cost of the coach will be $550. The entry cost to the park is $30 for each student. The national park gives one free ticket for every ten that are bought, which must be taken into consideration.
Set up a program that:

• stores the cost of the coach
• stores the cost of an entry ticket
• inputs the estimated number of students taking part, this must be validated on entry and an
unsuitable entry rejected
• calculates and outputs the recommended cost per student to ensure the trip does not make a loss.

Write an algorithm to complete Task 1, using either pseudocode, programming statements or a
flowchart. [5]

What do character formats do for your document's message? a. set the tone b. provide organization c. provide clarity d. set how texts align with documents

Complete the sentence based on your knowledge of the professional difficulties faced by music artists. digital technology allows audiences to see free live telecasts of music or dance performances through

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)