You will be implementing a basic case of the map-reduce pattern in programming. Use the built in C++ array functions std::transform for map and std::accumulate for reduce to solve the following problem.

Given a vector stored as an array of numbers, find the magnitude of the vector (this is similar to the function hypot()). Use the standard distance formula for n-dimensional Cartesian coordinates.

Examples

magnitude([3, 4]) ➞ 5

magnitude([0, 0, -10]) ➞ 10

magnitude([]) ➞ 0

magnitude([2, 3, 6, 1, 8] ) ➞ 10.677078252031311

Notes

• The array can have any length.
• The input array will contain integers (except for empty array [] ➞ 0).
• Use both std::transform(...) and std::accumulate(...).
• Don't use hypot().