Copy paste the python code and send me the screenshot also if it is possible to check the indintation $.$ The language of the below code is pythonnewtons method does not work when the input function is cos$($x$)-$x$/3,$ i tried inputting np$.$cos$($x$)-$x$/3,$ and sym$.$cos$($x$)-$x$/3$ and "cos$($x$)-$x$/3"$ and non of them work, they all give me an error.It should print the root that was found for each method $($bisection$,$ newtons and secant$)$ and the table of iterations for each This is my code:#Question $1($works$)$import sympy as symimport numpy as npfrom sympy import symbols, sympify, cosfrom prettytable import PrettyTable def bisection$\_$method$($func$,$ a$,$ b$,$ error$\_$accept$)$: def f$($x$)$: return eval$($func$)$ error $=$ abs$($b $-$ a$)$ iterations $=[]$ while error $>$ error$\_$accept: c $=($b $+$ a$)/2$ if f$($a$)*$ f$($b$)>=0$: print$("$No root or multiple roots present, therefore, the bisection method will not work!"$)$ quit$()$ elif f$($c$)*$ f$($a$)<0$: b $=$ c error $=$ abs$($b $-$ a$)$ elif f$($c$)*$ f$($b$)<0$: a $=$ c error $=$ abs$($b $-$ a$)$ else: print$("$Something went wrong"$)$ quit$()$ iterations.append$([$len$($iterations$)+1,$ a$,$ b$,$ c$,$ f$($c$)])$ print$($f$"$The error is $\{$error$\}")$ print$($f$"$The lower boundary, a$,$ is $\{$a$\},$ and the upper boundary, b$,$ is $\{$b$\}")$ return iterations #newtons methoddef newtons$\_$method$($x$1,$ iterationNumber, func, E$)$: def f$($x$)$: return eval$($func$)$ x $=$ sym$.$Symbol$(\text{'}$x$\text{'})$ sympified$\_$func $=$ sym$.$sympify$($func$)$ # Renamed variable to avoid conflict df $=$ sym$.$diff$($sympified$\_$func, x$)$ f$\_$func $=$ sym$.$lambdify$($x$,$ sympified$\_$func, 'numpy'$)$ df$\_$func $=$ sym$.$lambdify$($x$,$ df$,$ 'numpy'$)$ x $=$ x$1$ iterations $=[]$ for i in range$($iterationNumber$)$: x$\_$next $=$ x $-($f$\_$func$($x$)/$ df$\_$func$($x$))$ residual $=$ np$.$abs$($f$\_$func$($x$\_$next$))$ iterations.append$([$i $+1,$ x$,$ f$\_$func$($x$),$ df$\_$func$($x$),$ x$\_$next$])$ if residual $<$ E: return x$\_$next, iterations x $=$ x$\_$next return None, iterations #Secant methoddef secant$\_$method$($func$,$ x$0,$ x$1,$ E$,$ iterationNumber$)$: def f$($x$)$: return eval$($func$)$ iterations $=[]$ iteration $=0$ while iteration $<$ iterationNumber: f$\_$x$0=$ f$($x$0)$ f$\_$x$1=$ f$($x$1)$ if abs$($f$\_$x$1)<$ E: iterations.append$([$iteration$+1,$ x$0,$ x$1,$ x$1,$ f$\_$x$1,0])$ return x$1,$ iterations x$\_$next $=$ round$($x$1-$ f$\_$x$1*($x$1-$ x$0)/($f$\_$x$1-$ f$\_$x$0),6)$ residual $=$ abs$($x$\_$next $-$ x$1)$ iterations.append$([$iteration$+1,$ x$0,$ x$1,$ x$\_$next, f$\_$x$1,$ residual$])$ if residual $<$ E: return x$\_$next, iterations x$0,$ x$1=$ x$1,$ x$\_$next iteration $+=1$ print$("$Warning: Secant method did not converge within the specified maximum number of iterations."$)$ return None, iterations def main$()$: func$\_$str $=$ input$("$Enter the function in terms of x: $")$ x $=$ symbols$(\text{'}$x$\text{'})$ x$1=$ float$($input$("$Enter the first initial guess value $($x$1)$: $"))$ x$2=$ float$($input$("$Enter the second initial guess value $($x$2)$: $"))$ E $=$ float$($input$("$Enter the tolerance$/$error value $($E$)$: $"))$ n$=$ int$($input$("$Enter the maximum number of iterations: $"))$ # Bisection method table bisection$\_$iterations $=$ bisection$\_$method$($func$,$ x$1,$ x$2,$ E$)$ bisection$\_$table $=$ PrettyTable$()$ bisection$\_$table.field$\_$names $=["$Iteration$","$a$","$b$","$c$","$f$($c$)"]$ for iteration in bisection$\_$iterations: bisection$\_$table.add$\_$row$($iteration$)$ print$("$

Bisection method iterations:"$)$ print$($bisection$\_$table$)$ # Newton's method solution, newton$\_$iterations $=$ newtons$\_$method$($x$1,$ n$,$ func, E$)$ if solution is not None: print$($f$"$Newton$\text{'}$s method converged to solution: $\{$solution$\}$ with residual: $\{$np$.$abs$($f$\_$func$($solution$))\}")$ print$($f$"$The root found by Newton's method: $\{$solution$\}")$ else: print$("$Newton$\text{'}$s method did not converge within the specified maximum number of iterations."$)$ #newtons table newton$\_$table $=$ PrettyTable$()$ newton$\_$table.field$\_$names $=["$Iteration$","$x$","$f$($x$)","$f$\text{'}($x$)","$x$\_$next"$]$ for iteration in newton$\_$iterations: newton$\_$table.add$\_$row$($iteration$)$ print$("$

Newton's method iterations:"$)$ print$($newton$\_$table$)$ # Secant method table solution, secant$\_$iterations $=$ secant$\_$method$($func$,$ x$1,$ x$2,$ E$,$ n$)$ if isinstance$($solution$,$ float$)$: print$($f$"$The root found by the secant method: $\{$solution$\}")$ secant$\_$table $=$ PrettyTable$()$ secant$\_$table.field$\_$names $=["$Iteration$","$x$0","$x$1","$x$\_$next", $"$f$($x$\_$next$)","$x$\_$next $-$ x$1"]$ for iteration in secant$\_$iterations: secant$\_$table.add$\_$row$($iteration$)$ print$("$

Secant method iterations:"$)$ print$($secant$\_$table$)$ if $\_\_$name$\_\_=="\_\_$main$\_\_"$: main$()$