For each pair in a$-$c$,$ define the two terms, and explain their relationship $($similarities and differences, as appropriate$).$ For any data structures given you must assume implementations we have used in class. Your responses should be $3-6$ sentences per part.

a$.$ Linear Search and Binary Search $($include some discussion of Big$-$O notation$)$

b$.$ Stack ADT and Queue ADT $($include which one is easier to implement efficiently, and why$)$

c$.$ Dynamically Allocated Array and Vector Class $($assume C$++$ implementations$)$