In running time analysis, which of following is not one of the reasons why we focus on the worst-case running time? (a) The average case time is often difficult to determine. (b) The worst case is easier to analyze. (c) It is crucial to applications such as games, finance and robotics. (d) The running time of an algorithm inversely grows with the input size. Which statement is true regarding Theoretical Analysis of Running Time? (a) It uses a high-level description of the algorithm instead of an actual implementation. (b) It characterizes running time as a function of the input size. (c) It takes into account all possible inputs. (d) It allows us to evaluate the speed of an algorithm independent of the hardware/software environment. (e) All of above. In running time analysis, which of following is not one of the reasons why we focus on the worst-case running time? (a) The average case time is often difficult to determine. (b) The worst case is easier to analyze. (c) It is crucial to applications such as games, finance and robotics. (d) The running time of an algorithm inversely grows with the input size. Which statement is true regarding Theoretical Analysis of Running Time? (a) It uses a high-level description of the algorithm instead of an actual implementation. (b) It characterizes running time as a function of the input size. (c) It takes into account all possible inputs. (d) It allows us to evaluate the speed of an algorithm independent of the hardware/software environment. (e) All of above