ProgramTrinomialDP.javathat takes two integer command-line argumentsnandkand computes the trinomial coefficientT(n,k)

T(n,k)usingdynamic programming. To do so, organize your program according to the following public API:

public class TrinomialDP { // Returns the trinomial coefficient T(n, k). public static long trinomial(int n, int k) // Takes two integer command-line arguments n and k and prints T(n, k). public static void main(String[] args) } 

computeT(n,k)

T(n,k)by using the following recurrence relation:

T(n,k)=

1 , ifn=0andk=0

0, ifkn

T(n1,k1)+T(n1,k)+T(n1,k+1), otherwise

The Output should be:

~/Desktop/recursion> java-introcs TrinomialDP 3 0

7

~/Desktop/recursion> java-introcs TrinomialDP 24 12

287134346

~/Desktop/recursion> java-introcs TrinomialDP 30 0

18252025766941

~/Desktop/recursion> java-introcs TrinomialDP 40 0

934837217271732457