Lab Assessment

Implement the Breadth First Search algorithm shown in the description section in Prolog, And Describe how your code follow the algorithm. (You can also add a trace screenshot for your goal)

ALGORITHM TO IMPLEMENT BREADTH FIRST SEARCH STEP 1: Enter the node to be found. STEP 2: Create a variable called NODE-LIST and set it to the initial state. STEP 3: Until a goal state is found or NODE-LIST is empty do : (a)Remove the first element from NODE-LIST and call it E. IF NODE-LISt was empty , quit. (b) For each way that each rule can match the state described in E do: i. Apply the rule to generate a new state. ii. If the new state is a goal state, quit and return this state. iii. Otherwise, add the new state to the end of NODE-LIST. STEP 4: Print the output as the path traversed. STEP 5: Exit. Nodes reachable from B Open list [BC] Nodes reachable from C CDCE). [D CEBE (BEGFECG] [C E BE GF] D [E BEGTE] [EGFECGED] [GF ECGEDBG] [F ECGEDBGE]