Find the value of every non-terminal node in the expectiminmax tree given above. Also indicate which action will be performed by the algoirithm. What is lowest and highest possible outcome of a single game if the minmax strategy is followed against an optimal opponent?

Algorithm to Expectiminimax using alpha-beta pruning and fail-soft enhancement.in: node v; alpha value α; beta value βout: utility value of node vconstant: the range of value(•) for a leaf node is [
min,
max]

Problem 2: Consider the following game tree in which the evaluation function values are shown below each leaf node. Assume that the root node corresponds to the maximizing player and the search always visits children from left-to-right. Which nodes will not be examined by the alpha beta pruning algorithm? Please show them by double crossing on the edges of the graph below МAX MIN МАX MIN 23 -10 28 10 -19 -49 -26

In the minimum spanning tree problem formulation, if n is the total number of nodes, and the edges between any two nodes i and j is rij- The variables Tij are defined in the model as: Select one: O Continous O Integer O None of the mentioned Binary O Integer or Continous