For 3.9b, implement two search algorithms (one using BFS and another using DFS) in Java or C++. Keep the programs' output simple: Just print out (using System.out or cout) the steps (with resulting states) needed (one line per step) to reach the goal state.
Answers to 3.9a, 3.9c, and 4.5 should be prepared electronically (.doc, .txt, or .pdf).
Submit a zip file containing three directories: BFS, DFS, HW (the last directory contains solutions to 3.9a, 3.9c, and 4.5). All code submitted should be your own work. Submitting code copied from someone else or dowloaded from the internet will be dealt with severely.