Simple Javascript only:  Convert a Hexadecimal array of numbers into decimal values. The decimal values should be treated as ASCII character codes and converted into characters. Return a string of those characters. See the MDN docs for `String.fromCharCode()` method for how to convert character codes into ASCII characters. https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCharCode Examples: hexadecimalToString(['0x004a']) => 74 => "J" hexadecimalToString(['0x0041', '0x0042', '0x0043']) => 65, 66, 67 => "ABC" hexadecimalToString(['0x0048', '0x0065', '0x0078', '0x0061']) => 72, 101, 120, 97 => "Hexa".   function hexadecimalToString(hexadecimalChars){ }

Build Brothers company in C    A civil engineering company called Build Brothers has approached you to write a program to help some of their employees with getting their job quicker specially when it comes to calculating different equations in their construction projects. Currently, they use the following PDF to perform all their calculations: http://www.madison-lake.k12.oh.us/userfiles/680/Classes/16192/IED-Review%20Engineering%20Formula%20Sheet.pdf They are willing to develop a small software to calculate all the functions and calculations in the above cheat sheet. They have made this decision to reduce inherent human errors during calculation and improve efficiency. They think that these can be achieved by an “advanced calculator” that allows a user to choose an equation, provide the inputs, and calculate the outputs. Before the company invests on the final product, the have agreed on developing a proof-of-concept first. The idea is that your solution will ‘prove’ that a better…

Can you fix the error in the python code.    import numpy as npimport matplotlib.pyplot as plt N = 20  # number of points to discretizeL = 0.15X = np.linspace(0, L, N) # position along the rodh = L / (N - 1)          # discretization spacing C0t = 0.200  # concentration at x = 0Cth = 0.00000409D = 0.0000025t_avg = 0n = 0  tfinal = 300Ntsteps = 1000dt = tfinal / (Ntsteps - 1)t = np.linspace(0, tfinal, Ntsteps) alpha =( D * dt / h**2) C_xt = [] # container for all the time steps # initial condition at t = 0C = np.zeros(X.shape)C[0] = C0t C_xt += [C] for j in range(1, Ntsteps):    N = np.zeros(C.shape)    N[0] =  C0t    N[1:-1] = alpha*C[2:] + (1 - 2 * alpha) * C[1:-1] + alpha * C[0:-2]    N[-1] = N[-2]  # derivative boundary condition flux = 0    C[:] = N    C_xt += [N]        if ((Cth-0.000001) < N[-1]<(Cth+0.000001)):      print ('Time=',t[j],'conc=',[N[-1]],'Cthr=',[Cth])      t_avg = t_avg+t[j]      n = n + 1     # plot selective solutions    if j in…

python compose a code fragment that writes the contents of a two dimensional array of bools, using * to represent Trye and a space to represent false include row and column numbers