How can we modify the CUT-ROD algorithm that we studied in class so that it imposes a fixed cost per cut when partitioning the rod into smaller picces? Fill in each of the three boxes below with Java code that correctly completes the integer function bottomDpCutRodInclCutcost( int(1 P, int n, int costPercut) which when passed: (1) int array p [O . . n] (where p [ ?] is the price for which an i-inch-long piece of rod can be sold); (2) int n (the total length in inches of a rod available for cutting); and (3) int costPerCut (a fixed cost incurred once for each cut made in the rod) returns the maximum net revenue (total sale price minus total cutting cost) that can be obtained by selling the rod after partitioning/cutting it into an optimally chosen set of smaller pieces (each of which has length equal to some positive integer number of inches). You should assume that pIo1-0;that Pl]>0 for all oisn; and that 0 s costPerCut min p[1]. PI2]. PI3]....PIn]. 01 public static int bottomopCutRodIncicutcost( int!] P int n , int costPercut 02 03 intt1 pMinusCutCost new int[n+1] 04 int(1 new int[n+1] 05 for int 1 : k