in C++ please

i) Ask the user for the capacity first, then keep getting the items until their total exceeds the capacity. Output the final total, without exceeding the capsicity. Enter copacity: 10 Input items: 3 5 1 4 Total: 9 2) After outputting the total, accommodate the final item in the next package and keep going! Infinite loop is OK. Enter capacity: 10 Input items: 3 5 1 4 To 3 5 Total: 7 3) After outputting the total, accommodate the final item in the next. package and keep goingl Infinite loop is OK. Loop read item IF it can be accommodated add to total ELSE output current total init total with this item Enter capacity: 10 Input items: 3. 5 4 Total: 9 3 5 Total: 7 4) Each item weights 1 or 2 or 3 lbs. Capscity of each bex is 3 thes. Given N of items in each weight, determine minimum \# of boves needed