$1.$ Compare the time complexity of the erasing k random edges and k random vertices from random, mesh, and complete graphs of increasing size of vertices, n for both choices of containers: vector and unordered set. k defines the number of edges and number of vertices to be erased and state the value of k you are using. For example, you can use k as one$-$fourth the initial number of edges and vertices respectively as provided in the skeleton code.