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: .Ro(N) is the running time of the algorithm when it is run on the worst case input . Rs(N) is the running time of the algorithm when it is run on the best case input Check all of the True statements. A.R(N) E O(N) C.h(N) E O(N) G.Rs(N) E O(N) HR (N) E O(N2) . R(N) E O(N3) K.Ro(N) e(N2)