Q$1.$ Given the number overlapping polygons with coordinates are given below. Propose an algorithm and its mathematical equivalence that follows the principal of depth coherence to identify the visible surfaces of the overlapping polygon. Note: The square is at the front.

$(10M)$