1 pts D | Question 6 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. Let us denote: .R (N) is the running time of the algorithm when it is run on the worst case input . R, (N) is the running time of the algorithm when it is run on the best case input Check all of the True statements. A Ru (N) E O(N) C.R. (N) (N3) E.Ru (N) E (N*) F.R. (N) E e(v3) G.R(N) E O(N) H.R (N) O(N) L. Ro(N) E OUNd) G.R,(N) E O(N) R&(N) E O(N3 E G A