this is Data structures and algorithms, please answer them so i can check my answers

2. Write a pseudo code of a while-loop to find the sum of all multiples of 3 between x and y inclusively. You can assume that 01 is a prime number or not. Hints: (1) We can use a loop to check for each integer i smaller than x whether x is divisible by i. (2) If we want to make it quicker, we can stop earlier, the question is when should we stop the loop