The post lab 6 assignment involves an extension the the drawing program from post-lab 2 to add the ability to draw curves. In order to draw curves, points on the curve must be calculated. The de Casteljau algorithm can be used to find any point on a Bezier curve. So, for this sub-post-lab assignment you will implement the de Cateljau algorithm recurisvely. The file BezierCurve.java contains a class that represents a Bezier curve. It uses the class ArrayList.java to store all of the control points that define the curve. The deCasteljau method in the BezierCurve class should be completed so that it computes the point on the curve at the specified parametric distance. Use the JUnit testing file BezierCurveTest.java to test your code and use Checkstyle to verify formatting.
Submission: Tar and submit your code on the course Inquire site.