26The worst-case time complexity of linear search is:AO(1)BO(n²)CO(log n)DO(n)View AnswerWorkspaceReportSaveEasy