Assuming a rod length of 6, provide a p array, such that the optimal cutting solution requires exactly two cuts. Your p array must "make sense," containing only positive numbers and be monotonically increasing (i.e., p[i+1] > p[i] for all i). Consider an extension to the rod cutting problem in which every cut incurs a cost, and the cost varies based on where the cut occurs (at integer cut points). Carefully describe the changes you would make to the algorithm to accommodate this change. Refer to Extended-Bottom- Up-Cut-Rod()