Binary Search in an Array of Sorted Strings ( Using character comparison till null is reached)

Description: You are responsible to write an assembly function to perform searching of a list of names in stored in ascending order. This function will use the binary search algorithm. The names could be stored in mixed case. Therefore your assembly function must do the comparison in a case insensitive manner. This function will use the C function signature but everything within this function should be assembly code using the ASM block similar to the assembly example shown in class. Program Specification: int b_search (char list[100][20], int count, char* token); list – the starting address of the list of names to be searched count – total number of names in the list token – name to be search in the list This function returns the position of the token in the list (starting with 1). If the name is not found, then it returns 0. When it returns 0, print a message on the console.