State if an algorithm satisfying the formal definition of an

State if an algorithm (satisfying the formal definition of an algorithm) which is guaranteed to find a solution exists or not for each of the following problems by filling the blanks with Y (for \"yes (an algorithm guaranteed to find a solution exists)\") or N (for \"no (an algorithm guaranteed to find a solution does not exist)) (i)Finding a path from the given start location to the given goal location in a finite maze that changes unpredictably (ii) Finding if two rectangles intersect or not (iii) Finding the list of all prime numbers (iv)Finding the list of all multiples of eight (v)Finding all real numbers between two and three (vi)Multiplying finite number of given positive (vii) Finding a path from the given start location to (vii) Finding the volume of a sphere whose center (ix)Finding the area of a pentagon the coordinates (x)Finding the perimeter of a hexagon when the (xi)Finding the oldest person in a group when integers the given goal location in an infinite maze and radius are given of whose vertices are given coordinates of its vertices are given birth dates of all members of the group are given

Solution

1. Yes
2. Yes  
3. No
3. Yes
4. No
5. No
6. No
7. Yes
8.yes
9. No
10. No
11. Yes
12. No
13. No
14. No
15. Yes
16. Yes
17. Yes
18. Yes
19. Yes
20. Yes