A. C. for(i=0;i

please solve number C I solved numbers a and b so I do not need number a and b  Problem (taken from page 308 of the textbook)A parking lot has 31 visitor spaces, numbered from 0 to 30. Visitors are assigned parking spaces usingthe hashing function h(k) = k mod 31, where k is the number formed from the first three digits on avisitor’s license plate.a) Which spaces are assigned by the hashing function to cars that have these first three digits ontheir license plates: 317, 918, 007, 100, 111, 310?b) Describe a procedure visitors should follow to find a free parking space when the space they areassigned is occupied.c) A large parking-systems company would like to automate your assignment procedure forselfparking cars. You have been hired to implement a ”simple” proof-of-concept program in C++, fornow customers will enter their 3 digit plate numbers and your software will assign a parkingspace. Your implementation should a find a free parking space if the original assigned space isoccupied.…

Prompt: In Python language, write a function that applies the logistic sigmoid function to all elements of a NumPy array. Code:   import numpy as np import math import matplotlib.pyplot as plt import pandas as pd   def sigmoid(inputArray):               modifiedArray = np.zeros(len(inputArray))               #YOUR CODE HERE:               return(modifiedArray) def test(): inputs = np.arange(-100, 100, 0.5) outputs = sigmoid(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs,'Black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()

Homework 7: Merging two sorted arrays Due date: Saturday March 18. Objectives: Learn to implement algorithms that work with multiple arrays. Understand the Merging algorithm. IMPORTANT. Carefully study Lecture 1 from Week 8 on D2L before you start on this.   Sometimes we need to combine the values in two sorted sequences to produce a larger sorted sequence. This process is called Merging. As an example, if the first sequence (S1)contains the numbers 2 3 4 4 5 9 and the second sequence (S2) contains the numbers 1 4 5 8 9 11 12 13 17 the output sequence will contain 1 2 3 4 4 4 5 5 8 9 9 11 12 13 17 Each sequence can be stored in an array. The strategy is as follows: Start by comparing the first items in the two input arrays. Write the smaller number to the output array, and move to the the next item in that array. This is repeated until we reach the end of any one of the input arrays; thereafter, we simply copy all the numbers from the other input array to the output array. (In the…