implement programming methods in matlab that would prioritize individualsby vaccine phase and dose number. In 8 sentences or less, please describe the specificprogramming methods (examples of programming methods are while loops and logicalindexing) to implement priorities. Do not use any built-in functions, such as sort or find.

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…

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

In Lisp

In matlab

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")

In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume

Write a C++ program with an EuropeanOption class (with fixed strike price K). It should hold information such as option type (call or put), spot price (of the underlying asset), strike price, interest rate, volatility (of the underlying asset) and time to maturity. Constructors don’t accept illegal values. Implement a getPrice() function which gives the price of the option using path independent simulation of the stock prices. Using the following dynamics for the stock price with the constant values: dSt= rStdt + σStdWt S0= 100 K = 105 r = 0.02 σ = 0.05 T = 10. Add more features to the class it should contain four member functions to compute the numerical Greeks (getDelta() for spot price, getRho() for interest rate, getVega() for volatility, and getTheta() for time to maturity) of a given option.

t for several problems you will modify some provided Python code to implement algorithms to solve the same instance of the knapsack problem. After implementing all of the code and solving the problem, you must provide a single table of all results similar to the following: Table 1: Example of results summary (numbers are not realistic) Algorithm Iterations Items Selected Weight Objective Local Search (Best Improvement) 3102 49 97 117 Local Search with Random Restarts (k = 100) Local Search with Random walk (p = 0.25) 9510 121 21 147 2102 87 32 184 etc. Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and weight (w), select a combination of the items to maximize the total value without exceeding the weight limitations, W, of the knapsack. IMPORTANT!: When generating random problem instance set you must use the code provided and values: n = 150; max weight of 2500; and, use a seed value (for the random number generator) of 51132023.

Write a recursive function, numMoves(), that takes a number representing the number of disks in the Hanoi problem, and returns the number of moves involved. I recommend you start writing this function by modifying the hanoi.py program given. Test cases: numMoves(3) should return 7 and numMoves(4) should return 15. Do not use any global variables.   hanoi.py