<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('D', 'F'), ('E', 'F')], can you find all maximal cliques in this graph using the NetworkX `find_cliques_recursive` function?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('D', 'F'), ('E', 'F')])

# Find all maximal cliques in the graph
maximal_cliques = list(nx.find_cliques_recursive(G))

print('Maximal cliques:', maximal_cliques)
<|EOT|>
