Please answer all question correctly!! Thanks

The Alpha-Beta pruning technique is used to improve the runtime of the minimax algorithm. Answer the following questions about it's performance: a. What is the worst case runtime of minimax using Alpha-Beta pruning? b. What is the best case runtime of minimax using Alpha-Beta pruning? c. What is the average runtime of minimax using Alpha-Beta pruning? d. Under what conditions can we achieve the best case runtime? e. Under what conditions will Alpha-Beta pruning not prune any branches at all