Computational Topology - Vietoris-Rips Complex Graph

Note: This is a repost of the previous question I posted. The previous "expert" copied and pasted my work, and I reported and banned him from future work at Chegg. Thus, I removed my work. Do not be that person please. If you can't answer it, skip it.

Write code for the function RipsGraph (P,d) as follows. -P-a set of points P C R2 given as a k 2 numpy matrix -d - a diameter d0 Output a networkx graph which is the 1-skeleton of the Rips complex VR(P, d , 1]ple. I]. Draw thisgrap han an overlay on the points (even though there will likely be crossings) Write code for the function RipsGraph (P,d) as follows. -P-a set of points P C R2 given as a k 2 numpy matrix -d - a diameter d0 Output a networkx graph which is the 1-skeleton of the Rips complex VR(P, d , 1]ple. I]. Draw thisgrap han an overlay on the points (even though there will likely be crossings)