Intelligent systems work, alpha-beta search project

This is a single project where you are given a tree and the static evaluation function on its leaves (which are not necessarily all at the same level of depth). You have to do the exercise beforehand with pencil and paper to be able to answer the questions that are asked about its operation: initial values of alpha and beta in some nodes, sequence of values through which alpha and beta pass in some nodes, values returned by the algorithm for some nodes, nodes where alpha and beta cuts occur.

As for the alpha and beta cuts, we must consider all those that occur, even those that have no effect on the search because the cut occurs after exploring the last of the children of the node.