COSC 311 Homework 9/7/2016 A programming interview question Distributed: 9/7/2016 Due: 9/12/2016 Write Java code that minimizes execution time and memory usage. Input: A file contains at most 1,000 integers. The integers are in the the range 0 .. 999. No integer can appear more than once in the input file (causes catastrophic failure). There are no other data. You may use a sentinel (-1) to indicate end of input stream if you want to. Output: A sorted list in increasing order of input values. Your code should not use any Java objects beyond basic character stream I/O (use of Scanner is ok). Do not use the sort() method provided by any Java library. Do not use Array. Do not use Integer. You are permitted to code up any sort algorithm you want (there is a pretty pseudo-code implementation of insertion sort at https://en.wikipedia.org/wiki/Insertion_sort#Algorithm_for_insertion_sort ). Hint -- a little misdirection going on in the previous sentence. However! I warn you that points are taken off for excessive line count. That includes all the flotsam and jetsam necessary for making your code modular, reusable, portable, team-friendly, etc. You are to focus on the **algorithm**. Line count is measured by counting ';' -- so white space can be added without penalty. Turn in: Hardcopy of your code. In your code, include a header: [your name] [your URL] COSC 311 HW 09/07 FALL 2016. Do NOT comment your code. Do not supply UML diagram for your code.