la la la :la ,la la la la la la la :la ,la la la find the sequence of courses that allows bob to satisfy all the prerequisites - suppose we represent graph having vertices and edges with the edge list structure whyin this casedoes the insert vertex method run in ( time while the remove vertex method runs in (mtimer- let be graph whose vertices are the integers through and let the adjacent vertices of each vertex be given by the table belowvertex adjacent vertices (