Which statement below best describes the Activity Scheduling Problem discussed in the class notes? The problem is a member of the class P The problem is a member of the class NP-complete None of the other options is correct. Which statement below best describes the Graph Reachability Problem discussed in the class notes? The problem is a member of the class F The problem is a member of the class NP-complete None of the other options is correct Which statement below best describes the Traveling Salesman Problem (TSP) discussed in the class notes? The problem is a member of the class F The problem is a member of the class NP-complete None of the other options is correct. Which statement below best describes the Sorting Problem? The problem is a member of the class P The problem is a member of the class NP-complete None of the other options is correct. Which statement below best describes the Halting Problem? The problem is a member of the class F The problem is a member of the class NP-complete None of the other options is correct. Which statement below best describes the k-Vertex Cover Problem discussed in the class notes? The problem is a member of the class P The problem is a member of the class NP-complete None of the other options is correct