design and implement a sophisticated GUI$-$based word search application using "Java JFrame" only,

that leverages both Brute Force and Knuth$-$Morris$-$Pratt $($KMP$)$ string$-$searching algorithms. This application will allow

users to efficiently search for specific words or sequences of words within a diverse set of text files. The project aims

to provide a comprehensive comparison of the performance characteristics of both algorithms in terms of time complexity

and efficiency in various matching scenarios.

Functional Requirements

Search Functionality:

The application must facilitate the user's ability to input a search term and initiate a search across multiple

text files.

The program should accurately locate and return the following details for each occurrence of the search term:

Name of the file

Row number

Column number $($position within the row$)$

Advanced Matching Options: The program must include a set of advanced matching options to enhance the

flexibility and usability of the search functionality:

Whole Word Match:

Unchecked Option: The application should return all instances of the search term, including substrings

within larger words. For example, searching for "pak" should yield results such as "Pakistan", "adampak",

"abnopakis", and "pak".

Checked Option: The application should restrict results to exact matches of the search term, ensuring

that only whole words are returned. For example, searching for "pak" should return only "pak".

Case Sensitivity:

Unchecked Option: The application should be case$-$insensitive, meaning that variations in the upper and

lower case should not affect the search results. For example, a search for "bilal" should return "Bilal",

"bilaL", and "bIlaL".

Checked Option: The application should be case$-$sensitive$,$ returning results that match the case of the

search term exactly. For example, searching for "bilal" should yield only "bilal", while "BilaL" should be

returned for "BilaL".

Performance Evaluation:

The application must implement both the Brute Force and KMP algorithms to perform the word search.

Upon completion of each search, the application should record and display the time taken by each algorithm

to process the search.

Time Taken, Brute Force:

Time Taken, KMP