<｜begin▁of▁sentence｜>### Instruction:
As part of our ongoing compliance review for our company's process flow systems, we need to ensure that all operational loops meet industry regulations. We have a process map modeled as a direct flowchart, with the current connections between steps outlined as (0 to 1), (1 to 2), (2 to 0), and (2 to 3). To maintain complete oversight, it's essential to identify all existing loops within this flowchart. 

Could you utilize the NetworkX toolkit specifically employing its recursive algorithm feature to conduct a thorough analysis of our process map and pinpoint every simple loop? This step is crucial in preparing our documentation for regulatory submissions and ensuring that our procedures adhere to the required standards.
### Response:
import networkx as nx

# Create a DiGraph
dg = nx.DiGraph()
# Add edges to the graph
dg.add_edges_from([(0, 1), (1, 2), (2, 0), (2, 3)])
# Find simple cycles
simple_cycles = list(nx.recursive_simple_cycles(dg))

print('Simple Cycles:', simple_cycles)
<|EOT|>
