Given an undirected graph G (V, E) consider the directed relation RC be- tween edges (!) in the graph: Edge ei RC e; if there exist a simple cycle in G that contains both e; and ej. Argue that RC induces a partition of the set of edges. Give an idea (english) of how will you go about outputing (edge sets) the com- ponents of this partition.

The question is asking to consider the directed relation that's called RC, between any two edges in the graph. For any two edges, ei this relation in ej in G, the relationship exists if there exists a simple cycle in G that contains both ei and ej. Thinking about this relationship RC, the problems asks to argue RC induces a partition with the set of edges. Just the idea of computing the components of this partition that comes out of this relationship.