Apply greedy algorithm to the problem of the minimum length triangulation of a convex polygon. How far can greedy be away from optimum? Show the worst case for a pentagon Whoever finds the largest ratio between greedy and the optimum will get extra credit

NB: Please solve the question. don't just write the steps of how to do it. if you need to draw please draw and solve. there are other answers to this question, but they just wrote the steps. please help i don't know how to solve greedy algorithm. so please do the whole thing.