Just give theoretical description and prove of your algorithm, no need codes.

We are given an n n table of letters. We have redefined "word" to mean an increasing (by ASCII value) chain of characters from length 3 to length n2. For example, "ABCD" is a legal four-letter word, and "MICROSOFT" is not a legal word because the sequence is not increasing. "BILL" is also illegal, and 'BIL" is however legal. A word may start anywhere in the table and is constructed by forming a chain of adjacent letters, where "adjacent" means diagonal, vertical, or horizontal. A word cannot use any character from the table more than once. Here is an example of a 4 4 table. BILLIE HELE The following is a partial list of legal words that can be found using the above rules: BILFP, AELST, AEGLPT Design a backtracking algorithm to find all legal words Design a branch-and-bound algorithm to find a longest word. We are given an n n table of letters. We have redefined "word" to mean an increasing (by ASCII value) chain of characters from length 3 to length n2. For example, "ABCD" is a legal four-letter word, and "MICROSOFT" is not a legal word because the sequence is not increasing. "BILL" is also illegal, and 'BIL" is however legal. A word may start anywhere in the table and is constructed by forming a chain of adjacent letters, where "adjacent" means diagonal, vertical, or horizontal. A word cannot use any character from the table more than once. Here is an example of a 4 4 table. BILLIE HELE The following is a partial list of legal words that can be found using the above rules: BILFP, AELST, AEGLPT Design a backtracking algorithm to find all legal words Design a branch-and-bound algorithm to find a longest word