You have been given an array of size $"$n$\text{'}$ containing the number of diamonds in each pouch. You also have the number of trips $\text{'}$t required to transfer all the diamonds from the godown to the jewellery shop. It is necessary to maintain the order of the pouches in the array while transferring the diamonds. You cannot send more diamonds than the number of diamond boxes in one trip.Your task is to find the minimum number of damond boxes required to transfer all the diamonds from the godown to the jewellery shop in $\text{'}$t$\text{'}$ trips. This means that on each trip, you will take as many diamonds as possible from the pouches but ago not more then the avilable number of diamond boxes. The order of the pouches in the array is important and must be maintained throughout the process.Constraints:$9191406010501$stsns $10431$s arril $50$Input FormatLine one takes the size of the array, and the next line takes elements of the given size.Next line number of trips. Output FormatA minimum number of Diamond Boxes.Testcase Input$212222$Testcase Output$2$Explanationmagendin.We can send diamonds in $2$ trips with the minimum boxes required are $3$In the following way:$-$trip $1>>1+2+3$trip $2>>22$Sample Testcase #$1$Testcase Input$412344$Testcase Output$4$Sample Teptcase iTestcase Input$412344$Testcase Output$4$ExplanationWe can send diamonds in $4$ trips with minimum boxes required are $4$In the following way.Trip $1>>1+1$Trip $2=>>22$Trip $3*>>33$Trp $4>>>4+4$