Write three algorithms for calculating the factorial $N!$

$($a$)$ Using a brute$-$force approach

$($b$)$ Using decrease$-$and$-$conquer

$($c$)$ Using divide$-$and$-$conquer

$($d$)$ Which of the algorithms is the most efficient $($proof required$)?$