b. Write a Python function taking as input a positive integer n, and returns a list of all Pythagorean triples [a, b. c] with c < n. For example, if n = 13, then the output of your function should be [[3. 4. 5], [5, 12, 13], [6, 8, 10]].

Implement a function pairsThatSum that accepts two arguments: 1. a target number2. a list of numbers the function then returns a list of tuple s that contains all pairs of numbers from the list that sum to the given target number. Note: the pair can be two numbers with the same value, e.g. (2,2) but these must be different items (have different locations) in the list. See the last example below. each pair should be reported only once (don't include a pair and its reverse), and each pair's values should be listed in the order that they occur in the list. E.g., the first example records the pair (0,3) instead of the pair (3,0) , because 0 occurs in the list before 4 . the list of pairs should be ordered by the order of the first value in the list, e.g., (0,3) comes before (1,2) because 0 comes before 1 in the list. (note: if you take the right approach, you won't have to do anything extra for this requirement)   Below is an example of the output from the code: >>>…

I am to write a function in python that will return a List L of 2 values that are equal to an integer called s. Lets say L = [1,5,2,7] and s = 12. I want the function to return [5,7] and if the list does not have values that are equal to s, it should return an empty List. want it to run in O(n) time. Starting function: def sum_of_two(L,s):