8. termine if vertex x is Using an adjacency matrix, how many steps will it take to de adjacent to vertex y? c) O(V+E) d) o(v2) b) orv) Using an adjacency matrix, how many steps will it take to find all vertices adjacent to vertex x Howmany steps does it take to perform a BFS of a graph? If we have a sparse graph with n vertices and the degree (number of incident edges) of every node is at most 10, how long will depth first search take? 9. 10. 11