G we What is the definition of P class. of problems ? What is the definition of NP class of problems? Explain why P is a subset of NP. Give an example of a problem that is in NP and is not in P. For each of these 3 algorithms, state input, output, e complexity: 6 Prim w Kruskal i Dijkstra (complexity should be the way discussed in class) # If a graph algorithm has complexity ( v?+Ve), what's the worst o complexity of this terms of V? in terms of E? 9 1 writing each chapter, I will have quotation that captures the spirit of the chapter. For which chapter, I use the quotation "If don't learn from history you are foomed to repeat it."? 'And' why? in an Om algorithms book. For a "If you might