please use this code to anwser the question:

#include

#define FLUSH stdin$=$freopen$($NULL$,"$r$",$stdin$)$

$//$ Prototype for Recursive function Tn$()$

$//$ You must remove this prototype before you submit your assignment

unsigned long Tn$($int$)$;

$//$ This function must collect the n to print T$\_$n number in Tribonacci sequence.

int get$\_$n$()$;

$//$ In this function, you must create an array of series.

$//$ You must fill the array with the Fibonacci numbers.

$//$ This function returns the HEAP address of such array

$//$ Parameter: n you get from the get$\_$n$()$ function.

$//$ Note: this function must create array of size n$+1(!)$

$//$ Must detect integer overflow and adjust parameter n to the maximum allowed.

unsigned long$*$ tribonacci$\_$array$($int$*)$;

$//$ This function prints T$\_$n Tribonacci number.

$//$ Accepts n value you get from get$\_$n$()$ function.

$//($Note: pointer is used so you can modify value n in case of integer overflow!$)$

$//$ Note: inside this function must call tribonacci$\_$array$()$ function above!

void print$\_$Tn$($int$*)$;

$//$ Define MIN$\_$NUMBER and MAX$\_$NUMBER symbolic constants that you d use to limit the input of size:

$//$ This is starting point. See below how main$()$ function should look like in your solution!

int main$()\{$

int n $=20$;

printf$("$This program calculated Tribonacci number T$\_$n$,$

$")$;

printf$("$T$\_$n$=$T$\_($n$-3)+$T$\_($n$-2)+$T$\_($n$-1),$ where T$\_0=$T$\_1=0$ and T$\_2=1$

$")$;

printf$("$Tribonacci Number T$\_\%$d $=\%$lu

$",$ n$,$ Tn$($n$))$;

return $0$;

$\}$

$/*$ Your main$()$ function must look like this:

int main$()\{$

printf$("$This program calculated Tribonacci number T$\_$n$,$

$")$;

printf$("$T$\_$n$=$T$\_($n$-3)+$T$\_($n$-2)+$T$\_($n$-1),$ where T$\_0=$T$\_1=0$ and T$\_2=1$

$")$;

$//$ Get value n

int n $=$ get$\_$n$()$;

$//$ Print value T$\_$n

print$\_$Tn$($&n$)$;

return $0$;

$\}$

$*/$

$//$ You must remove this function before you submit your assignment

$//$ Tribonacci numbers $($start from n$=0)$: $0,0,1,1,2,4,7,13,24,44,81,149,274$

unsigned long Tn$($int n$)\{$

if $($n $<mtext\; id="EditorElement\_138336"></mtext><mn\; id="EditorElement\_138337">2</mn><mi\; id="EditorElement\_138338">)</mi>$ return $0$;

if $($n $==2)$ return $1$;

return Tn$($n$-1)+$ Tn$($n $-2)+$ Tn$($n$-3)$;

$\}$

$//$ You need to create this function.

$//$ See comments for the prototype!

int get$\_$n$()\{$

$\}$

$//$ You need to create this function.

$//$ See comments for the prototype!

unsigned long$*$ tribonacci$\_$array$($int$*$ n$)\{$

$//$ Note: size of array should be n$+1(!).$ So that T$\_5==$ array$[5]!$

$\}$

$//$ You need to create this function.

$//$ See comments for the prototype!

void print$\_$Tn$($int$*$ n$)\{$

$\}$