I. Section I: Definitions: Please define the following terms in clear, concise, and college level writing.

Minimum Spanning Tree $-$

Hamiltonian Cycle $-$

Greedy Algorithm

Compare$/$Contrast Prim's algorithm vs$.$ Kruskal's algorithm. When you use each?

Compare$/$Contrast Dijkstra's algorithm vs$.$ Bellman$-$Ford algorithm. When would you use each?

In the context of computer science, what is algorithmic complexity, and how do you measure it$?$