Write Naïve (Brute force) Algorithm function only. Using Python. ( do not use AI Tools to solve It please) Implement 1. Naïve (Brute force) Algorithm 2. Boyer-Moore Algorithm to search for “ababada” pattern in the given input.txt text file. Your program should be able to read from a text file called input.txt and search through it. The program then displays the number of occurences of this pattern and how long it takes in milisecs for each algorithm.

Implement the following function: Code should be written in python.

PYTHON cannot use numpy, opencv, array, readline( ), or enumerate. can only use open, read, write, and close methods for files. please utilize split and append functions

1. Write a program that reads two strings from the keyboard using a while loop A.Terminate the loop when both strings have the same content, done B.Display both strings if the contents are different C.For strings with the same contents, display if they are at the same address 2.Demonstrate a situation in which the JVM will use garbage collection 3.Given the following strings: Middlesex CollegeDemonstrate the use of the following String methodsconcat(), length(), trim(), charAt(), both substring()

Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list