Write a function named "Bisection.m" which takes an input of (a,b,Tol,f) and returns an output [root, NumIter], where "NumIter" is the number of iterations it took to find the root. If the function can't find a root, the variable "root" should output as a string with an error message like 'No root found'. f should be an anonymous function.