CODE IN C/C++

Solve the 8 puzzle problem using the following algorithm written in C/C++ and the output file should appear like so

BFS search DFS search function BREADTH-FIRST-SEARCH (initialState, goalTest) function DEPTH-FIRST-SEARCH (initialState, goalTest) returns SUCCESS or FAILURE: returns SUCCESS or FAILURE frontier Que.new(initialState) explored Set.new frontier Stack.new(initialState) explored-Set.new while not frontier.isEmptyO: while not frontier.isEmpty: state frontier.dequeue) explored.add(state) state frontier.pop) explored.add(state) if gonlTest(state): if goalTest(state): return SucCESS(state) return SucCESS (state) for neighbor in state.neighbors if neighbor not in frontier U explored frontier.enqueue(neighbor) if neighbor not in frontier U explored: frontier push(neighbor) return FAILURE return FAILURE A* search Iterative deepening A* Takes from the edX cearse ColembiaX: CSMML1O1s Artificial Intelligence (AD function A-STAR-SEARCH(initialState, goalTest) From Wikipedia, the free encyclopedia procedure ida star(root) SUCCESS or FAILURE:/Cost bound :- h(root) loop frontier- Heap.new(initialState) explored Set.new() t s- search(root,e, bound) if t-FOUND then return bound if t- then return NOT FOUND bound end loop while not frontier.isEmpty0: state frontier.deleteMin explored.add(state) if goalTest(state): for neighbor in state.neighbors0: function search(node, bound) fg+ h(node) if fbound then return f if is goal (node) then return FOUND return SucCESS (state) for suce in successors(node) do t se search(succ,&cest(node, succ), bound) if taFOUND then return FOUND if temin then min t if neighbor not in frontier U explored: frontier insert(neighbor) end for return min else if neighbor in frontier end function frontier decreaseKey(neighbor) return FAILURE