Write a python program and add a function called add_matrix() to it. This function takes two 2-D lists of integers (matrix) as parameters and computes their sum, if a sum can actually be computed. Otherwise, it returns an empty list. Note that, two matrices can only be added together if they have the exact same dimensions. If the dimensions are acceptable, then the resulting matrix will also have the same dimensions as its operands, and the value of each element in the resulting matrix is the sum of the corresponding elements in the input matrices. Hint: test rectangularity (the number of rows and the number of elements in each row must be the same in two matrices) before attempting addition. Sample output: >>> matrix1 = [[2,3], [4,5]] >>> matrix2 = [[9,0], [8,6]] >>> print(add_matrix(matrix1, matrix2)) [[11, 3], [12, 11]]

Write a program in PYTHON with a function max(L) which examines the argument list L, and returns the largest object of type float. If there is no float object in the list, then the function returns None. For example,max([100, 'blue', 3.5, 'sugar on the rocks', 7.0]) would return 7.0, andmax([7, 2, 9, 1]) would return None. Note that type(element) == float is a way to check if element is a float

Write a Python function (give it any name you choose) to analyze a text string given to it. The function will receive one single string as argument It will return two tuples of two elements each: One tuple contains the word with the maximum occurrence in the input text and the number of its occurrence. The other tuple contains the longest word with in the input text and the number of characters in it. The function should be called like function1(text), where text is a string variable. Use the paragraph below to test your code:   text = ‘’’During a wet autumnal walk, I was explaining to my girlfriend about my recent presentations. I've been doing my 'Getting Started with Python' talk at Aruba Airheads meet-ups. I recorded an early version of it, see below. One point I mentioned is that the reaction is always mixed. When I ask who is learning Python, about 5% of each audience put their hands up. Regularly people object to the idea of network engineers learning Python. The arguments…

Write a function lis_rec(arr) that outputs the length of the longest increasing sequence and the actual longest increasing sequence. This function should use divide and conquer strategy to the solve the problem, by using an auxiliary function that is recursive. For example, one possibility is to define a recursive function, lis_rec(arr, i, prev), that takes the array arr, an index i, and the previous element index prev of LIS (which is part of the array arr before index i), and returns the length of the LIS that can be obtained by considering the subarray arr[i:]. Write a dynamic programming version ofthe function, lis_dp(arr), that outputs the length of the longest increasing sequence and the actual longest increasing sequence by using a table to store the results of subproblems in a bottom-up manner. Test the performance of the two functions on arrays of length n = 100, 500, 1000, 5000, 10000. Compare the running times and memory usage of the two functions.

In python write a program that computes and prints the average of the numbers in a text file. Because the numbers are read in from a text file, the number inputs are considered text. For example, there is the number 5 and there is a text 5. You can't do arithmetic operations on text. It must be converted to the number equivalent. You will make use of a few higher-order functions, map(), lambda and reduce(), to simplify the design. The basic outline of this program is as follows: Ask user for input file name and check to be sure it is valid Prepare input file for reading Get the numbers from the input file in to a list variable Convert the list variable string items to float numbers using the map and list functions Compute the sum of the numbers using the reduce and lambda functions Print the average of the numbers in the list. If the length of the list is zero then the average is zero.

Implement a function pairsThatSum that accepts two arguments: 1. a target number2. a list of numbers the function then returns a list of tuple s that contains all pairs of numbers from the list that sum to the given target number. Note: the pair can be two numbers with the same value, e.g. (2,2) but these must be different items (have different locations) in the list. See the last example below. each pair should be reported only once (don't include a pair and its reverse), and each pair's values should be listed in the order that they occur in the list. E.g., the first example records the pair (0,3) instead of the pair (3,0) , because 0 occurs in the list before 4 . the list of pairs should be ordered by the order of the first value in the list, e.g., (0,3) comes before (1,2) because 0 comes before 1 in the list. (note: if you take the right approach, you won't have to do anything extra for this requirement)   Below is an example of the output from the code: >>>…

Write a function using Java   Function Name: winInRowParameters: board: 2D integer array, row: integer, piece: integerReturn: booleanAssume board is valid 2D int array, row is valid index in the board, piece is X==1/O==2Look at indicated row at given index in board. If that row has at least 3 consecutive entries withgiven type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.