<｜begin▁of▁sentence｜>### Instruction:
Given two rooted trees T1 with root 'a' having the edge set [('a', 'b'), ('a', 'c'), ('b', 'd'), ('b', 'e')] and T2 with root 'f' having the edge set [('f', 'g'), ('g', 'h'), ('f', 'i'), ('i', 'j')], can you determine if they are isomorphic and provide a possible isomorphism using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms import isomorphism

# Create two rooted trees
T1 = nx.Graph()
T1.add_edges_from([('a', 'b'), ('a', 'c'), ('b', 'd'), ('b', 'e')])
root1 = 'a'

T2 = nx.Graph()
T2.add_edges_from([('f', 'g'), ('g', 'h'), ('f', 'i'), ('i', 'j')])
root2 = 'f'

# Find rooted tree isomorphism
mapper = isomorphism.rooted_tree_isomorphism(T1, root1, T2, root2)
print('Isomorphism:', list(mapper.items()))
<|EOT|>
