Please do the code for this in OCaml.

Part $2$: Recursive Functions

Implement the following functions using recursion.

pow $($x:int, p:int$)$

Type: int $->$ int $->$ int

Description: Returns x raised to the power p $.$

Assumptions: p is non$-$negative, and we will not test your code for integer overflow cases.

Examples:

pow $3,1=3$

pow $3,2=9$

pow $(-3),3=-27$

fac $($x:int$)$

Type: int $->$ int

Description: Returns the factorial of $x$ as an integer.

Assumptions: You may assume the answer is non$-$negative, $x1.$

Examples:

fac $4=24$

fac $5=120$

fac $7=5040$

fac $2=2$