$[8$ points$]$ In the minimax game tree below, apply alpha$-$beta pruning, and fill in the values of $w,b$ for nodes A through B$,$ indicating the worst and best values $($for the player about to move$)$ once the pruning is complete. Initial values of $w,b$ for each node are $-,+.$ Only modify the $w,b$ values necessary.

Circle the nodes, if any, that are pruned $($not evaluated$).$

List the final values

please solve this with explanation