Task: "Create an algorithm folder with Q1 and Q2 subfolders. In each folder, write the given algorithm in Python, Java, and JavaScript, using filenames in the {question}_{language} format, such as Q1_python.py and Q1_java.java.

Q1: Write a function that returns the nth value of the Fibonacci sequence.
Q2: Given two n x n binary matrices mat and target, return true if mat can be made equal to target by rotating mat in 90-degree increments; otherwise, return false. (n == mat.length == target.length, n == mat[i].length == target[i].length)"
Annotator hint: "Create an algorithm folder, and inside it create two subfolders: Q1 and Q2. In each folder, write the given algorithm in Python, Java, and JavaScript. Create and save a total of six files using the {question}_{language} format: /Q1/Q1_python.py, /Q1/Q1_java.java, /Q1/Q1_javascript.js, /Q2/Q2_python.py, /Q2/Q2_java.java, and /Q2/Q2_javascript.js.  Q1: Write a function that returns the nth value of the Fibonacci sequence. Q2: Given two n x n binary matrices mat and target, return true if mat can be made equal to target by rotating mat in 90-degree increments; otherwise, return false. (n == mat.length == target.length, n == mat[i].length == target[i].length)"