Consider the following graph Apply breadth-first-search-traversal on the above graph. Which traversal is possible if the start vertex is G? (Assume lexicographic ordering of the adjacency lists). 1. GAHJIBCEKD 2. GAHJIBCDEK 3. GAHIJBDEKC 4. GAHIJBCEKD 5. None of the above Original Idea by: Sadeeq Olalekan Bello