申論題

5. (15%) An independent set I of an undirected graph G = (V,E) is a subset of V such that for any two vertices u and v in I, u and o are not adjacent,i.e.,. Design a dynamic program to find the largest independent set in a tree.
***Please explain the high-level idea of your answer in English or Chinese. ***