Suppose we know that an algorithm has a runtime R(N) that is quadratic in N for the worst case input, and linear in N for the best case input. Check all of the True statements A.RIN) E O(N) B.RI(N) E O(N2) C.R(N) E OIN) ER(N) e (N2) ER(N) E (N3) GR(N) E (N) HR(N) e (N2) J. The size of the worst case input is larger than the size of the best case input. K. For sufficiently large N, the running time of the algorithm is greater when run on the worst case input than when run on the best case input. K