6. Let M be a plane graph, given to you as its DCEL representaion. Let f = pq be a segment, where P and q are vertices of M. Suggest an algorithm, as efficient as posible to create a DCEL representaion of the map that is obtained by adding f into the map. Note that f might cross several faces. of M. The running time should depend only on the complexity of the faces that f crosses (might be much smaller than n). This is a simple question, that just tries to remind what is DCEL