Given an empty array of size 7 called SUBSET and a full array of size 500 called ITEMS, write pseudocode to input two numbers and then fill SUBSET (starting at the index location indicated by the first number input) with as many items as possible from ITEMS (starting at the index location indicated by the second number input). If the items selected from ITEMS do not fill SUBSET completely, any remaining space in SUBSET should be filled with zeros. The algorithm should gracefully avoid attempting to process any unreasonable numeric input.