Write a Matlab script Fibonacci.m that uses the function input to ask for an integer n, checks if n > 0 and, it is the case, computes the n-th term, an of the Fibonacci's sequence defined by ao = a₁ = 1, ak= ak-1+ak-2. with a for loop. The implementation can be done with: (i) a vector a with n+1 components (you should initialize the vector with a-zeros (1,n) before the loop)

Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. A pythagorean quadruple states that x^2 + y^2 + z^2 = w^2. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.

Finally, we will do some simple analysis – ranking of words. Write a function word_ranking(corpus, n, sort_index) which takes input parameters corpus (type list), n (type int), and sort_index (type int) and returns a list containing tuples of words and their frequencies in the top n of words. Here, corpus is a list of sentences. n is the number of ranked words to return. The resulting list should then be sorted based on the sort_index; sort_index = 0 should sort the list of tuples in ascending alphabetical order, while sort_index = 1 should sort the list of tuples by the frequencies in descending order. All other numeric values for sort_index should return an empty list (don't need to consider non-integer inputs). For example, we have: corpus = ['hi hi hi hi', 'hello hello say bye', 'bye bye']n = 3sort_index = 1   The function should return:   [('hi', 4), ('bye', 3), ('hello', 2)]   While sort_index = 0 should return:   [('bye', 3), ('hello', 2), ('hi', 4)]     You can assume n would…

Write the code in python to define the function has_adjacent_repeats(mystr), which takes a string parameter and returns a boolean result.   - If mystr has at least one instance of adjacent characters being equal, return True   - Otherwise, return False Hint: You can iterate over the positive indices i for characters in mystr: 1, 2, 3, ...., len(mystr)-1 with a for loop. For each i, if the character at index i matches the character at index i - 1, return True. Otherwise, if no doubled character is found in the entire string, return False. For example: Test Result if not (has_adjacent_repeats("NOODLES") is True): print("error")   if not (has_adjacent_repeats("Bananas") is False): print("shwoopsie")   if not (has_adjacent_repeats("Hanoverr") is True): print("error")

Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys",  while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". Restrictions: printf and strlen are the ONLY C library functions that you can use in the implementation. void rotate(char *w, int j)