Its about approximation algorithmI need detailed answerthanks

I. Given a simple, undirected graph G = (V, E), a square is four edges of the form (u, v), (v, w), (w, u), where u, v, w E V. Consider the Triangle Interdiction Problem (TIP), which is to find a minimum size S set of edges such that for each triangle T in G, TnS . Use the primal- dual method to design and analyze a combinatorial 3-approximation any LP. What is the running time of your approach? I. Given a simple, undirected graph G = (V, E), a square is four edges of the form (u, v), (v, w), (w, u), where u, v, w E V. Consider the Triangle Interdiction Problem (TIP), which is to find a minimum size S set of edges such that for each triangle T in G, TnS . Use the primal- dual method to design and analyze a combinatorial 3-approximation any LP. What is the running time of your approach