5. Create an algorithm for an undirected graph with n vertices and m edges that a. Takes as a parameter some integer k b. Returns the maximum induced subgraph where each vertex of that subgraph has a degree greater than or equal to k (or returns null if no such subgraph exists) c. Operates in O(n + m) time

          5. Create an algorithm for an undirected graph with n vertices and m edges that
a. Takes as a parameter some integer k
b. Returns the maximum induced subgraph where each vertex of that subgraph has a degree greater than or equal to k (or returns null if no such subgraph exists)
c. Operates in O(n + m) time