I really need your help to write this !!
-Using loop constructs, finds the m th and n th Fibonacci numbers fm and fn (do NOT
MATLAB functions; do NOT utilize arrays).
3. Finds the greatest common divisor of fm and fn, by making use of loop constructs
(do NOT use builtin
functions for finding the GCD or factoring the numbers; do
not utilize arrays; use of basic functions such as MOD(), REM(), FLOOR(), etc.
4. Determines whether the GCD value is another Fibonacci number fk. If so, prints
the k value on the screen, if not, displays
0 · ·