In AVL trees, explain the running times of the following methods?

$($a$)$ balance$()$

$($b$)$ insert$()$

$($c$)$ delete $()$