The FastGreedy algorithm gives a good approximation for the dominating set problem. Develop an algorithm to return a minimum dominating set. Compare the speeds of the revised and the original algorithms on small graphs of increasing sizes (numbers of nodes). Plot these speeds verses size, and fit functions to the data.