Suppose that you want to implement an algorithm that will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. What advantage would this algorithm have over Minimax? (if none, Justify).

solve in C please. Implement the following two functions that get a string, and compute an array of non-emptytokens of the string containing only lower-case letters. For example:● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"].● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"].● For a string "abc 12EFG hi ", the list of such tokens is ["abc","hi"].● For a string " abc ", the list of such tokens is ["abc"].● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at thetokens with lower-case letters only .1. The function count_tokens gets a string str, and returns the number ofsuch tokens.int count_tokens(const char* str);For example● count_tokens("abc EFaG hi") needs to return 2.● count_tokens("ab 12 ef hi") needs to return 3.● count_tokens("ab12ef+") needs to return 0.2. The function get_tokens gets a string str, and…

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Letters are case sensitive, for example, "Aa" is not considered a palindrome here.   Constraints: 1 <= s.length <= 2000 s consists of lowercase and/or uppercase English letters only. Function definition for Java:      public int longestPalindrome(String s) {    } Function definition for Python: def longestPalindrome(self, s):   #Your code here Announced Test Cases: Example 1: Input: s = "abccccdd" Output: 7 Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7. Example 2: Input: s = "speediskey"Output: 5Explanation: The longest palindrome that can be built is "seees", whose length is 5.

Java language

write python program 10x10 grid, agent top right corner, traversing terrain = 1 time unit, rough terrain = 5 time units, and others terain = cannot be reached An A* based search function that takes a list of lists as argument and generates as a result a list of grid cell coordinates starting at the upper right and ending at the lower left and representing the fastest path for the agent to travel. E.g., path = aStarSearch(map). The path can be empty if there is no route.

Without importing any Lib:

Implement the following function that returns a vector of vectors of Item, each of which is a subset of elements chosen from the given vector a[first…last]:  /* if a is {1,2,3}, first=0, last=2, the function shall returns a vector of the following vectors:    {}, {1}, {2}, {3}, {1,2},{1,3}, {2,3},{1,2,3}, all subsets of a[0…2].    Precondition: last-first+1>=1, i.e., there is at least one element in the a[first…last]    Note 1)if the length of a[first…last] is n, then the function should return a vector of 2n vectors      2) The order of these subsets does not need to match what’s listed here…  */ vector<vector<int>> subsets (const vector<int> & a, int first, int last)   code

Implement a function pairsThatSum that accepts two arguments: 1. a target number2. a list of numbers the function then returns a list of tuple s that contains all pairs of numbers from the list that sum to the given target number. Note: the pair can be two numbers with the same value, e.g. (2,2) but these must be different items (have different locations) in the list. See the last example below. each pair should be reported only once (don't include a pair and its reverse), and each pair's values should be listed in the order that they occur in the list. E.g., the first example records the pair (0,3) instead of the pair (3,0) , because 0 occurs in the list before 4 . the list of pairs should be ordered by the order of the first value in the list, e.g., (0,3) comes before (1,2) because 0 comes before 1 in the list. (note: if you take the right approach, you won't have to do anything extra for this requirement)   Below is an example of the output from the code: >>>…