Help please with "c language" please …..?

Uncover two nonnegative phone numbers whose quantity is 9 while that your jewelry of one particular number and the square with the other number may be a maximum.

Write a new function termed sumIs9 in which returns a good int plus accepts an int as a parameter.
This kind of function earnings 9 – the parameter int.
The sumIs9 function doesn’t print anything.

Generate a functionality named solution that profits an int plus accepts a couple ints when parameters.
This functionality returns the first parameter * minute parameter * minute parameter.
The item function isn’t going to print anything.

Generate a main function in which returns a int in addition to accepts very little parameters.
Remember the matter:Find not one but two nonnegative phone numbers whose quantity is 9 while that your jewelry of one particular number and the square with the other number may be a maximum.
Most of your should use a loop that involves a variable to visit from 1 approximately 8.That’s your PRIMARY nonnegative selection.
Send this particular number in your sumIs9 function that can return your second nonnegative quantity.
Obviously the sum of the 1ST and SECOND numbers is 9.Your sumIs9 functionality took care of their.
Now, send most of these two numbers into ones product perform.This purpose will return the item of the best parameter and the square with the second parameter.Print the actual output with the loop making sure that it seems like this (MATCH THIS KIND OF OUTPUT):

JUST ONE, 8 => 64
TWO, 7 => 98
…
SEVEN, 1 => 8

Do every one of the above steps.Inside most important, declare a selection of ints known as answers along with length EIGHT.
int answers8;

With your loop, store your returns with the product job inside this specific array.
Thus, answers0 get the cost 64 <- don't hardcode 64, this need to be the return belonging to the product function
answers1 get the price 98
…
answers7 get the price 8

Write a new function termed highest of which accepts a selection of ints plus an int.This kind of function earnings an int.
int highest( int arr, int length )

The greatest function isn’t going to print available anything!

The parameter known as length will probably hold the length of the range.The parameter called arr contains the plethora itself.
The best function employs a loop research the array and returns the most important value within the array.

Call the greatest function through your main.Send in answers and also 8.

With your main functionality, print the particular return of highest like that (98 isn’t the particular maximum.You can find the real maximum.)
2 and also 7 produce the most of 98

Please note:you will likely have to search for the 2 ints which produced in which maximum.That should take a different loop!

If you choose 2 nonnegative integers a, y in whose sum is usually 9 and you should maximize x2 * ful, then there is certainly really just 10 possibilities you should try:

times = 0, ful = 9
times = 1, y = 8
times = 2, y = 7
times = A FEW, y = 6
times = FIVE, y = 5
times = FIVE, y = 4
times = SOME, y = 3
times = SIX, y = 2
times = 8, y = 1
times = HUNTING FOR, y = 0

A brute force search provides you with the resolution pretty quickly.