Write a C$++$ program that verifies the answers to Part I with the following details.

Store the following values in an array of double $($six elements$).$

$f^0(1),f^{\text{'}}(1),f^{\text{'}\text{'}}(1),f^{\text{'}\text{'}\text{'}}(1),f^{(4)}(1),f^{(5)}(1)$

Note: You should compute the following for $f(x)=\sqrt[\phantom{2}]{x},$ first. $($You may do this step manually.$)$

$f^0(x),f^{\text{'}}(x),f^{\text{'}\text{'}\text{'}}(x),f^{\text{'}\text{'}\text{'}}(x),f^{(4)}(x),f^{(5)}(x)$

$f^0(1),f^{\text{'}}(1),f^{\text{'}\text{'}\text{'}}(1),f^{\text{'}\text{'}\text{'}}(1),f^{(4)}(1),f^{(5)}(1)$

Compute the value of the analytical solution using the $C++\sqrt[\phantom{2}]{1+h}.$

Define a separate C $++$ function that implements the Horner's Algorithm.

Call the Homer's Algorithm function to compute the approximate value of $\sqrt[\phantom{2}]{1+h}$ using Taylor polynomial of different degrees and different values for $h.$

Make sure your program compiles and produces results in a tabular format as shown below.

$\backslash$table$[[$Enter the value of $h=0\mathrm{.}1$:$,0\mathrm{.}1$