Python coding. Give the python code with proper indentation

Part B: Greedy Maximisation Write a function greedy_indset(adj_list) that accepts as input the adjacency list of a graph and produces as output a greedy approximation to a maximum independent set. In particular, your strategy should be good enough to find an optimal independent set for our example graph, i.e., you should get: > x greedy_indset(lec_graph) > is_indset(lec_graph, x ) True > len (x) 3 Describe the greedy strategy you are using inside the docstring of your function