[Q1] Given an image of size H x W (H = height and W = width), how many vertices and edges do the graphs built in each of Exercises 2 and 3 exactly have?

[Q2] Express the order of growth of the running time of each of the following functions using H and W instead of E and V and use Big-Theta notation.

Function | Best Case Worst Case

----------------------------------------|------------------------

get_reachable()

get_connected_components()

get_shortest_paths()