PLEASE help with 28-34 please just answer only; just multiple choice and true/false

28. True or False? A pointer variable's value is always a valid main memory address that points- to a main memory location that is legally accessible by your program. Hint Consider both the meaning of and the value of the pointer value NULL and the notion of a dangling pointer 29. True or False? From a purely theoretical point of view, it does not make any difference which general-purpose programming language is used to solve a particular algorithmic problem because all general-purpose programming languages "are created equal". 30. Fact The loop-free and subprogram-call-free segments of an algorithm take at most a "fixed" amount of time; that is, "fixed" with respect to the size of the problem. True or False? The time complexity of "fixed"-with-respect-to-the-size-of-the-problem segments is normally expressed as o(1) 31. True or False? Proving that the time complexity of an algorithm that correctly solves problem P is O (f (n)) is also a proof that the inherent time complexity of P is no worse than f (n) 32. Fact 2n E O (n!), but True or False? not (n! 33. Which one of the following time complexities is the worst; that is, which grows fastest? A: O (n10) B: o (2) C:(n) D: O (n!) E: O (nLogn) 34. Which problem's algorithm is "worst"? Why? A: Tower of Hanoi B: MatrixMultiplication() C: Fibonacci F()