Note that you may not use any string methods (e.g., replace, find, index, etc.) when writing the functions for this question (with some exceptions, detailed below). These methods could let you very easily complete these functions, but the point of these functions is to gain expertise in writing code directly dealing with strings and loops. No marks will be given for a function which includes calls to string methods. KEEP IN MIND THE NOTE ABOVE PLEASE NO CALL TO THOSE FUNCTIONS

PYTHON Code your own Python function to solve Ax=b. Add a documentation string section to be used with the Python function help() function. Demonstrate the function is correctly implemented, and explain your testing approach.

Using C++ Using your own creativity, make a set of function templates that have these features: This function must return a value. A function template with 1 template parameter, T. And, any other parameters you want. and then another function template but this time with 2 template parameters, T1 and T2. And, any other parameters you want.

Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { q += j; } w.at(i) - kaboom(v, w, i + 1); } = q; } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give…

Unique answer only