Write a Python function called "prime". It has one input and two outputs. The input can be

an integer or floating$-$point number. If it is a floating$-$point number, the input is rounded

down to the lower integer. For input n$,$ the function will output the n$^($th $)$ prime number and

floating$-$point value for the approximation of the nth prime number. If n is less than $1$ the

function output should be zero and zero. For n$=1,$ the output should be $2$ and $0.$ The

approximation function you should use for the n$^($th $)$ prime number $($n$>1)$ is:

p$($n$)=$n$*$ln$($n$)+$n$($ln$($ln$($n$))-0\mathrm{.}9385)$

Example output is shown in Figure $1.(17,11\mathrm{.}711979717435128)(17389,17381\mathrm{.}338888922735)$

Figure $1$: Test Output from prime function