True/False Questions. only the answer please. a. Worst-case analysis should be expressed using O(n), while best-case analysis should be expressed using Ω(n). b. If ?(?)=?(?(?)) then ?(?)=Ω(?(?)). c....

True/False Questions. only the answer please.


a. Worst-case analysis should be expressed using O(n), while best-case analysis should be

expressed using Ω(n).





b. If ?(?)=?(?(?)) then ?(?)=Ω(?(?)).





c. If ?(?)=?(?(?)) then 210 ?(?)=?(?(?)).





d. All other things being equal, an efficient recursive algorithm will finish faster than an

iterative algorithm.