Can I get help with these?

5. What is the sum of all integers between 1 and 299 that are not divisible by either the (3 marks) 6. Consider the following function written in Python 3 (recalling that range(x, y), in number 7 or the number 9? You must use Sigma notation and the rules discussed in class to solve this problem and you must show all your work. Python, refers to the sequence of values starting at x, counting up by 1s, and stopping aty-1. for a in range (1, n+1): for b in range (1, a+1): foo () foo () for c in range (5, a+1): for d in range (1, c): bar () If n has a value of 1000, how many times will the function foo() be called and how many times will the function bar () be called? You must solve this problem using Sigma notation (i.e., you must derive an expression that uses Sigma notation to specify how many times each of these functions will be called, and then you must find a closed form for this expression and evaluate for n = 1000). You must show all your work. (6 marks) 5. What is the sum of all integers between 1 and 299 that are not divisible by either the (3 marks) 6. Consider the following function written in Python 3 (recalling that range(x, y), in number 7 or the number 9? You must use Sigma notation and the rules discussed in class to solve this problem and you must show all your work. Python, refers to the sequence of values starting at x, counting up by 1s, and stopping aty-1. for a in range (1, n+1): for b in range (1, a+1): foo () foo () for c in range (5, a+1): for d in range (1, c): bar () If n has a value of 1000, how many times will the function foo() be called and how many times will the function bar () be called? You must solve this problem using Sigma notation (i.e., you must derive an expression that uses Sigma notation to specify how many times each of these functions will be called, and then you must find a closed form for this expression and evaluate for n = 1000). You must show all your work. (6 marks)