Use the example above to solve the following graph using backtracking search algorithm.

The solution you are looking for in this graph is represented by node P. Trace the backtracking search algorithm for this problem. Initialize the search as:

SL = [A]; NSL = [A]; DE = []; CS = A.

Backtracking Example Initialize : SL = [A1; NSL = [A1; DE = []; CS A; AFTER ITERATION CS SL NSL DE B A] [E B A] [HE BAHIEFBCDA] [IEBA] [EFBCDA [F B A] JFBA JFBCDA] [C A] GCA] G C DA [B C D A] 2 [EF BCDA] HI E I H E IH [B FJEIH [B FJEIH [F BCD A] C D A] Co J KL M Figure 3.29 A graph to be searched