An algorithm is written to return the first name beginning with L in a list of employee names. Which of the following is the algorithms worst case scenario?An algorithm is written to return the first name beginning with L in a list of employee names. Which of the following is the algorithms worst case scenario?The first name in the list begins with L$.$No names in the list begin with L$.$The last name in the list begins with L$.$The first half of the list has names beginning with alphabets before L$,$ and the second half of the list has names beginning with alphabets after L$.$