When proving a greedy algorithm "meets the lower bound" and therefore produces optimal solutions, which of the following should be proven? Group of answer choices The algorithm produces a better solution than any other greedy algorithm. If the algorithm takes time $\backslash$Theta $($f$($n$)),$ a better solution can't possibly be produced in time o$($f$($n$)).$ If another optimal solution exists, then there is a series of transformations to that solution that don't affect the optimality that can result in the present algorithm's solution. The best solution can't be better than the one the algorithm produces.