# programming exercise import random def make_matrix_random(a, b, у): '' (int, int, int, int)->2D list х, Returns 2D list representing a matrix with rows and b columns a a filled with random integers >=x and (=y Precondition: a, b positive and x <=y [] print (make_matrix_random (3, 5, 0, 10)) print (make_matrix_random (2, print (make_matrix_random(5, #3 the function should have randomness, function should have randomness, the function should have randomness, thus no expecting result 4, 10, 20)) # 3, 0, 10)) the thus no expecting result thus no expecting result %23 [С6, 2, 0, 6, 1], [6, 8, 2, 5, 8], [о, 6, 3, 2, 3]] [[11, 11, 16, 11], [15, 11, 16, 11]] [С7, 3, 6], [5, 8, 21, [6, 8, 6], [4, 3, 1], [10, 7, 9]]

Word frequencies (dictionaries) Implement the build_dictionary() function to build a word frequency dictionary from a list of words. Ex: If the words list is: ["hey", "hi", "Mark", "hi", "mark"] the dictionary returned from calling build_dictionary(words) is: {'hey': 1, 'hi': 2, 'Mark': 1, 'mark': 1}   half answered: code: def build_dictionary(words):# The frequencies dictionary will be built with your code below.# Each key is a word string and the corresponding value is an integer # indicating that word's frequenc # The following code asks for input, splits the input into a word list, # calls build_dictionary(), and displays the contents sorted by key.if __name__ == '__main__':words = input().split()your_dictionary = build_dictionary(words)sorted_keys = sorted(your_dictionary.keys())for key in sorted_keys:print(key + ': ' + str(your_dictionary[key]))

def large_matrix(matrix: list[list[int]]) -> int:"""Returns the area of the rectangle in the area of a rectangle is defined by number of 1's that it contains.The matrix will only contain the integers 1 and 0.>>> case = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_in_matrix(case1)6"" You must use this helper code: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = rowb = colmax = 0temp = 0rows = len(matrix)column = len(matrix[a])while a < rows and matrix[a][col] == 1:temp = 0while b < column and matrix[a][b] == 1:temp = temp + 1b = b + 1column = ba = a + 1if (a != row+1):temp2 = temp * (a - row)else:temp2 = tempif max < temp2:max = temp2b = colreturn max """ remember:  Please do this on python  you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import""'

Python data structures: write a function that takes in a list (L) as input, and returns the number of inversions. An inversion in L is a pair of elements x and y such that x appears before y in L, but x > y. Your function must run in -place and implement the best possible algoritm of time complexity.  def inversions(L: List) -> int:'''finds and returns number of inversions'''

In Python: Create a function Matrix_transpose() utilizing List comprehension techniques that takes a 2d list containing user generated/input elements of type int as its argument then returns the reference to a new 2d list that is the transpose of the original. Assume the matrix is rectangular. Show the funtion works with different values.  Do not use any python packages to create the funtion.

3 4 5 5 7 3 9 3 1 2 B 4 5 7 9 0 2 3 4 5 8 0 1 def calculate_trip_time( iata_src: str, iata_dst: str, flight_walk: List[str], flights: FlightDir ) -> float: Return a float corresponding to the amount of time required to travel from the source airport to the destination airport to the destination airport, as outlined by the flight_walk. PERBE The start time of the trip should be considered zero. In other words, assuming we start the trip at 12:00am, this function should return the time it takes for the trip to finish, including all the waiting times before, and between the flights. If there is no path available, return -1.0 >>> calculate_trip_time("AA1", 2.0 >>> calculate_trip_time("AA1", >>> calculate_trip_time("AA1", >>> calculate_trip_time("AA1", 0.0 >>> calculate_trip_time("AA4", 14.0 >>> calculate_trip_time("AA1", 7.5 >>> calculate_trip_time("AA1", 2.0 *** "AA2", ["AA1", "AA2"], TEST_FLIGHTS_DIR_FOUR_CITIES) "AA7", ["AA7"] "AA1"], TEST_FLIGHTS_DIR_FOUR_CITIES) "AA7", ["AA1",…

def large_rec(m: list[list[int]], r: int, c: int) -> int:"""Do not use any imports,  dictionaries, try-except statements or break and continue  please you must make use of the helper long here as you loop througheach row of the matrix returns the area of the largest rectangle whose top left corner is atposition r, c in m.>>> case1 = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_at_position(case1, 1, 2)6""" Helper code: def long(lst: list[int]) -> int: count = 0i = 0while i < len(lst) and lst[i] != 0:i = i + 1count = count + 1return count

Python code Screenshot and code is must

JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true

def grade_manipulation(grade_list):    '''    Question    You are working as a TA and the professor asks you to handle the    uncleaned student grades.     - First, substitute all grades that are None with a 0    - Second, reverse the order of the student grades    - Third, change the type of the list to a tuple     Args:        grade_list (list)    Returns:        tuple     >>> grade_manipulation([67, 95, 60, None, 100])        (100, 0, 60, 95, 67)     ''"    # print(grade_manipulation([67, 95, 60, None, 100]))    # print('---')