Un Left Language 1. Packet Stream Player 1> #In 9 1@ 11 * 12 + 13 ? 14 ALL A Stream Of N Packets Arrives At A Video Player. This Player Can Only Play Packets That Are Exactly 20 Units Long For Some Non-Negative Integer Value Of N (0 Sn). All Packets Are Repackaged In Order To The Largest Possible Value Of 2 Units. The Remaining Part Of A Packet Is Added To

 

 

 

 

 

 

 

left Language 1 > #in H ALL 1 2 1. Packet Stream Player A stream of n packets arrives at a video player. This player can only play packets that are exactly 20 units long for some non-negative integer value of n (0 sn). All packets are repackaged in order to the largest possible value of 2 units. The remaining part of a packet is added to the next arriving packet before it is repackaged. Find the size of the largest repackaged packet in the given stream. Example arrivingPackets [13, 25, 12, 2, 8] The first packet has 13 units. The maximum value of 2" that can be made has 2" 23-8 units because the next size up is 20-24-16.13-8= 5 units are added to the next packet. There are 5+25=30 units to repackage, 2" = 24 = 16 is the new size leaving 14 units. 14+12=26, the maximum units is 16 leaving 10 units. 10+2=12, the max units is 8 leaving 4 units, and so on. 9 10 11 12 13 14 15 16 17 long 18 19 20 21 int m The maximum repackaged size is 16 units. Function Description Complete the largestRepackaged function in the editor below Type here to search Test Results