複選題 31. 關於以下哪些問題適合用貪心演算法 (Greedy Algorithm) 求解？ (A) Shortest Path (B) 0/1 Knapsack Problem (C) Minimum Spanning Tree (D) Job Sequencing without Deadlines (E) Activity Selection Problem (F) Coin Change Problem (G) Interleaving String