I need flow chart

EE 215 Microprocessors Spring 2018 LAB #4 OBJECTIVE 1. Learn subroutines and stack manipulation. Use stack for passing by value. 2. Learn recursive algorithms in assembly language 3. Learn additional I/O by using the TRAP #15 instruction (task #3, #4, #14) 4. Learn assembly language commands: ASR, Bcc, TST, LEA, CMPA, etc. BACKGROUND: BINARY SEARCH A sorted list can be searched very efficiently for a number using a binary search for a target value. The low and high indices are determined. The value at the midpoint index is checked. If that value is greater than the target, the top half of the list does not need to be searched, and the high index is set to the midpoint index. If the value at the midpoint index was less than the target value, the low half of the index does not need to be searched, and the low index is set to the midpoint index. The search is repeated (recursively) until the target value is found at an index. Example: target value=7, first search index low=0, high-10, check value at index 5: 10-7 next search index low-0, high-5, check value at index 2: 4