

def 		_lowercase			(					lowercase__       ,     lowercase__						):
      # "Simpson Rule"
      # int(f) = delta_x/2 * (b-a)/3*(f1 + 4f2 + 2f_3 + ... + fn)
      __lowerCAmelCase :						Optional[Any] = (boundary[1] - boundary[0]) / steps
      __lowerCAmelCase :						List[str] = boundary[0]
      __lowerCAmelCase :						str = boundary[1]
      __lowerCAmelCase :						List[Any] = make_points(lowercase__       ,     lowercase__       ,     lowercase__						)
      __lowerCAmelCase :						Dict = 0.0
      y += (h / 3.0) * f(lowercase__						)
      __lowerCAmelCase :						Tuple = 2
      for i in x_i:
            y += (h / 3) * (4 - 2 * (cnt % 2)) * f(lowercase__						)
            cnt += 1
      y += (h / 3.0) * f(lowercase__						)
      return y







def 		_lowercase			(					lowercase__       ,     lowercase__       ,     lowercase__						):
      __lowerCAmelCase :						List[Any] = a + h
      while x < (b - h):
            yield x
            __lowerCAmelCase :						Tuple = x + h







def 		_lowercase			(					lowercase__						):  # enter your function here
      __lowerCAmelCase :						str = (x - 0) * (x - 0)
      return y







def 		_lowercase			(					):
      __lowerCAmelCase :						Union[str, Any] = 0.0  # Lower bound of integration
      __lowerCAmelCase :						int = 1.0  # Upper bound of integration
      __lowerCAmelCase :						str = 1_0.0  # define number of steps or resolution
      __lowerCAmelCase :						Any = [a, b]  # define boundary of integration
      __lowerCAmelCase :						Any = method_a(lowercase__       ,     lowercase__						)
      print(f"""y = {y}"""						)


if __name__ == "__main__":
 main()





def 		_lowercase			(					lowercase__						):
      return "".join(chr(ord(lowercase__						) + 3_2						) if '''A''' <= char <= '''Z''' else char for char in word						)


if __name__ == "__main__":
 from doctest import testmod

 testmod()


