given an array of integers and an integer target. Write a brute force algorithm that return true if there are two numbers in that array that sums to target. If there are no pair of numbers that sum to target, return false. Show the time complexity of the algorithm. According to my professor's response to this question, I should clearly address the time complexity.Pg$.02$

Learning

Outcome$($s$)$:

Instructors: State

the Learning

Outcome$($s$)$ that

match this

question

Question Two

Question Two

Given an array of integers and an integer target. Write a brute force algorithm

that return true if there are two numbers in that array that sums to target. If there

are no pair of numbers that sum to target, return false. Show the time complexity

of the algorithm.