Before solving the question, PLEASE MAKE SURE YOU HAVE a STRONG UNDERSTANDING OF the MATERIAL RELATED TO THIS PROBLEM AND DO NOT POST a SOLUTION UNLESS YOU ARE FULLY SURE ABOUT THE ANSWER. Show completely your solution and make it clearly readable. Please solve all the questions because all of them are related, and I cannot post each one individually as well as my package for this month is over and I really need them!

Any defect or disregard of these above conditions, will result in getting thumbs-down.

Using the most effective programing language that you think may fit with these problems, answer the following questions with TYPING the code (i.e, provide the code typed on the answer not only screenshot so I can copy it)

Q1: Write an algorithm that performs the summation of the consecutive_integers from 1-to-n

Q2: Write an algorithm that performs finding the highest number between n-given numbers:

Q3: Identify the same-name between n others' names with returning them as set.

Please solve all the questions completely and correctly or leave them for someone else!

- What if we add all the numbers from 1 to 10? 55 - 1 what if we add all the numbers from 1 to 100? 5050 The problem of finding the largest (maximum) number among n given numbers. What is the maximum value when there are eight numbers, such as 17,92, 18, 33, 58, 7, 33, 422 92 1) Check if there's the same name among the names of multiple people 2) If there are the same names, return them by putting them in the newly created result set. 3) The input to this problem is a list of names of n people 4) The result is a set containing the same names 5) When a list of person names, ["Tom", "Jerry", "Mike", "Tom"), is entered, the result is the set {"Tom"} because the name Tom appears twice