Develop a flowchart and also use the given pseudocode to write an algorithm that will do the

following functions a through g.

a. Read 12 integer numbers, and store in the array A; (let us input the 12 numbers, 16, 2, -2,

5, 4, -1, 10, -20, -18, 16, 17, -20).

b. Output these 12 numbers consecutively. (Once A[0] is outputted, the output procedure

will continue to output the rest of the numbers in the array A.)

c. Find the sum and average for these numbers in the array A.

d. Find the smallest and largest of these numbers in the array A.

e. Output their sum, average, the smallest and the largest.

f. Find the average of every pair of two numbers (adjacent to each other) and store in the

array B, and then store the sum and average of all the given numbers in the last two

locations of B also.

g. Finally, output the contents of array B.

h. For each subproblem (a through g), create a table which shows the execution and

debugging of your obtained algorithm.

Hints: Consider one subproblem (a through g) at at time. For each subproblem, use a page for

developing the solution for a subproblem. (That is, design a flowchart and then write its

algorithm in pseudocode). Then using another page, create a table which shows the execution

and debugging of your obtained algorithm. After you have done these for the subproblem. Then

repeat the same process for the next subproblem until your complete all the subproblems a

through g.

You need to use the connector for showing the flow of control. We are using divide and

conquer, and refinement techniques for finding the solution for the given problem. The outline

of the flowcharts for of complete solution for the whole problem are as follows. You need to

develop their details. [Slide 101 through 133 will be helpful!]