Assume that an already programmed Horner's Method function has been made that can be called using the syntax

Horners $($coeffs$,x).$ The variable coeffs is an array of coefficients in increasing order of the powers. You do not

need to reproduce the code for Horner's Method itself.

$($a$)$ Write a function in either $C++,$ Java, Python, or a pseudocode similar to one of those three languages that will

call the already programmed Horner's Method function to evalue the following expression. Just write the function

itself using the proper syntax for operations.

$b*b*$ Horners $([7,1,-3,4,5],a)$ where $a=x*x$ and $b=x*a$

$($b$)$ Count the number of multiplications and additions the function you wrote in part $($a$)$ uses to evaluate the

polynomial it represents.