For a general game tree $($i$.$e$.,$ not limited to the above tree$),$ are there any cases that the Alpha$-$Beta algorithm gives a different value at the root node than the Minimax algorithm? If yes, show an example; if no$,$ just say no$.$