algorithms analysis and design fast please

The best case of time complexity of sequential search that finds all keys is n Select one: True False It is a technique that divides the problem size into approximately equal part and working on all of these parts O a. BF b. Dec & C O c. D&C O d. Transformation