<｜begin▁of▁sentence｜>### Instruction:
Given a path graph with 5 nodes, can you find a maximal independent set of this graph? Additionally, can you find a maximal independent set that includes node 1?
### Response:
import networkx as nx

G = nx.path_graph(5)
indep_set = nx.maximal_independent_set(G)
print('Maximal independent set:', indep_set)

G = nx.path_graph(5)
indep_set_with_node = nx.maximal_independent_set(G, [1])
print('Maximal independent set containing node 1:', indep_set_with_node)
<|EOT|>
