LAB 4 FIBONACCI NUMBERS 4.1 Problem Statement 1. Write a program in LC-3 assembly language that computes F, the n-th Fibonacci number. 2. Find the largest F such that no overflow occurs, i.e. find n N such that Fv is the largest Fibonacci number to be correctly represented with 16 bits in two's complement format 4.1.1 Inputs The integer n is in memory location x3100: x3100 n 4.1.2 Outputs x3101 F x3102 N x3103 F 4.2 Example x31006 x3101 8 x3102 N x3103 F