pof- dobe Acrobat Reader DC View Window Help Tools PS1-1.pdfx 68.4% located in the Modules area Then answer the following questions (a) |3 points] Briefly describe what is meant by a P, NP, and NP-Complete algorithm. Give an example of each (b) [2 points] What is the overall asymptotic complexity (the big O) of the following function? Briefly explain why Note: No programming is necessary for this problem Just tell me what the big O of and provide a couple of sentences explaining how you arived at the solution template int search(const vector