The input to this problem consists of a sequence of 7-digit phone numbers written as simple integers (e. g. 5551202 represents the phone number 555-1202). the sequence is provided via an iterator. note that you do not get an array containing these phone numbers and you cannot go through the iterator more than once. the sequence is potentially too large to fit in the memory limit you are allowed for this problem so be careful about what data structures (if any) you use. no phone number appears in the input more than once. you may assume that phone numbers will not start with 0, although they may contain zeroes otherwise.
write precise pseudocode for a method that prints out the phone numbers (as integers) in the list in ascending order. your solution must not use more than 2 mb (where mb = 106 bytes) of memory. note that it may not use any other storage: files, hard drive, network, etc.) be sure to examine the handout on writing proper pseudocode for this course.
in your pseudocode you may only declare variables and arrays of these unsigned data types (these are not real java data types): bit (1 bit), byte (8 bits), short (16 bits), int (32 bits), long (64 bits). you may not use other data structures. explain why your solution is under the 2 mb limit. we will not grade this problem without an explanation of why your code is under the 2mb limit.