$T(n,x)=T(n-1,x-A(0))+$

$T(n-2,x-A(1))+$

$=-T(0,x-A(n-1))$

where $n$ is size of arany $x$ is tauget. variable

Write deivation for this recurrence relation and give time complexity