Consider a point of sale terminal at a supermarket that displays electronic versions of receipts in the following format
***Touch Supermarket***
Item 1 2000
Item 2 4000
Item 3 1000
Total: 7000
Amount: Seven thousand only.
Required: Create a program that has a menu with 10 items of your choice and allow a user to select up to a maximum of 5 items. The program should display a receipt like above (including the total amount in words)

conduct a survey from 10 people to discover most popular sport. the result will be typed in to the computer for analysis at the end of the survey analysis the result and disply the most popular sports “type in the letter Q for finish”
A athletes
B swimming
C football
D badminton

Write a Function that outputs
a) The String : The one half is 50%.
b) Two integers and their difference.
c) Two floats and the result of dividing one with the other.

use a while loop that finds the x3 where x = 20...10 (use the order
from 20 to 10 and not 10 to 20)

Write a C program to read 1 integer input from user. Multiply 3 to the input, convert the result to string and print the result.

Write a C program to read 1 integer input and 1 float input from user. With the inputs, calculate the quotient and print it to screen.

Kesa has changed RS as per unit consumption is one month as per the following condition-
1) unit>=200-> 0.50 paise/unit
2) unit>100 and unit <200->0.60 per/unit
3) unit> 50 and unit<100->0.70 per/unit
4) otherwise 0.8 per/unit
Note- 50 RS meter changes will also add.

The following data has been collected by a technician:
Gas volume: V=0.8 m^3
Gas pressure: p=160 kPa
Compression index: n=1.4
Pressure/volume relationship: pV^n=C
Work done = ∫(V1)^(V2) pdV
Evaluate C
Calculate the work done in compressing the nitrogen from 0.8 m^3 to 0.6 m^3 using:
integral calculus
Simpson’s rule
the mid-ordinate rule

You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below;
1. You will start from the top and move downwards to an adjacent number as in below.
2. You are only allowed to walk downwards and diagonally.
3. You can only walk over NON PRIME NUMBERS.
4. You have to reach at the end of the pyramid as much as possible.
5. You have to treat your input as pyramid.
According to above rules the maximum sum of the numbers from top to bottom in below example is 24.
*1
*8 4
2 *6 9
8 5 *9 3
As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9
1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum.

Write a C program to check two given integers whether either of them is in the range 100..200 inclusive.