The following function returns whether or not a capital “X” is present within a string. What is this function’s time complexity in terms of Big O Notation? Then, modify the code to improve the...

The following function returns whether or not a capital “X” is present within a string. What is this function’s time complexity in terms of Big O Notation? Then, modify the code to improve the algorithm’s efficiency for best- and average-case scenarios.