In this exercise you will implement a quintic polynomial solver. This will let you take boundary conditions as input and generate a polynomial trajectory which matches those conditions with minimal jerk.
Inputs Your solver will take three inputs.
1.start - [si, sii, siii]
2.end - [sf, sff, sfff]
3.T - The duration of maneuver in seconds.
Implement the JMT(start, end, T) function in main.cpp