For an undirected graph, a subset S of the vertices is called an independent set if there are no edges connecting any vertices in S. Therefore, for all i, j element S, there is no edge {i, j} in the graph. Given an undirected graph G = (V, E) with a binary tree structure, write a dynamic programming algorithm to compute the largest independent set of G in O (n)-time