1. Graph Algorithms Consider the following graph. Unless otherwise indicated, always visit adjacent nodes in alphabetical order. E 6 9 D 00 6 H

Assume that the grid is represented by a two-dimensional array.  Design an algorithm that lists all groups.

FAST

1) Design an algorithm using DFS that detects whether graph G has a cycle. State and explain running time. Graph G need not be connected. Write in Pseudocode, please. 2) BFS refresher: Suppose you have an n × n chessboard and a knight placed in one of the squares. Youwould like to find out the fewest number of moves needed to reach a given target square. Design an algorithmfor this task stated formally below: Input: An n × n chess board, a starting square S, and a target square T.Output: The fewest number of moves a knight takes to move from S to T. Write in Pseudocode, please.