3. [6] How can Dijkstra's algorithm be used to determine if an undirected graph is connected? How can Dijkstra's algorithm be used to determine if a directed graph is connected? 4. [6] Ignore the e-approximation scheme! Describe the other two (simple) discretizations used to find a weighted shortest path in polyhedral domains as discussed in class. Between these two, which one is better and why