Give an algorithm that minimizes the maximum load of bins forthe following description:

We are given a list of n items with sizes s1, 82,. . , Sn A sequential bin packing of these at in sad ins (That is, each bin has items si, si+1,. , s, for some indices i < j.) Bins have unbounded capacities. The load of a bin is the sum of the elements
PayPal Gateway not configured
PayPal Gateway not configured