1. (20 points). For each of the following claims, decide if it is true or false. No explanation is needed (e) (2 points) 100100 = (1). (f) (2 points) if f =0(9), then g = 2(1). (g) (2 points) if n3 = 12 (na). (h) (2 points) If an algorithm's worst case running time is O(n), it means that the running time is (n?) for all inputs of size n. (i) (2 points) 100 + 200n + 300n? =(n?) ) (2 points) != logi = O(n logn)