An Undirected Graph Hasnvertices Andeedges And Is Stored In Adjacency Linked Lis

An undirected graph hasnvertices andeedges, and is stored in adjacency linked lists. The edges DO NOT have weights. What would be thefastestalgorithm (in the big O worst case sense) to find the shortest path from vertex numberedxto vertex numberedy, assumingycan be reached fromx? Describe the algorithm, and state its big O worst case running time.