C++ simple task - tree search

I need a programmer to write a program to solve the following bridge and torch problem: Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person A can cross the bridge in 1 minute, B in 2 minutes, C in 4 minutes, and D in 5 minutes. When two people cross the bridge together, they must move at the slower person's pace. The question is, can they all get across the bridge in 12 minutes or less? Answer: Elapsed Time Starting Side Action Ending Side 0 minutes A B C D 2 minutes C D A and B cross forward, taking 2 minutes A B 3 minutes A C D A returns, taking 1 minute B 8 minutes A C and D cross forward, taking 5 minutes B C D 10 minutes A B B returns, taking 2 minutes C D 12 minutes A and B cross forward, taking 2 minutes A B C D The program should represent the different paths in a search tree. Its goal is to count the number of situations (leafs) until it gets the right answer (and print to screen) in every one of these searches: a. DFS search b. BFS search c. Best First search + Heuristic that attempts to predict how close the end of a path is to a solution and go that way. Please deliver 3 *.cpp files + 3 *.EXE files with the answer (one file for each search). BFS - [login to view URL] DFS - [login to view URL] Best First - [login to view URL] VERY IMPORTANT – it should be done until Nov. 12th at midnight!! Don’t take this project if you are unable to meet the time requirements!! If you have any question, don’t hesitate to ask me.