B$.$ For robotic curves $2,$ one of the most critical issue in programming the robot is the

direction of the robot path and detect how many time the robot will return the

reference line $(y=0)$

The following numerical iterative techniques can be used to these critical issues:

Bisectional method.

Newton$-$Raphson method.

In order to that you have been asked to use the above two methods to find the roots of

Equation"$1".$

Then examine the strengths and weaknesses of these methods in regards to :

Ease of application.

Applicability.

Accuracy.

Showing contrast view to conclude the best method.

$y=3x+sinx-e^x$