Is it even possible?

Question

Algorithms

I pass the test "school 21", and there are tasks for the simplest algorithms.
At some of the levels I saw this and still arrive in shock.
You need to collect all the stars with the "arrow".
We have a stack of 5 teams at our disposal. Commands can be any: move forward, turn right / left, color the current cell in a given color and return to the beginning of the cycle.
Each team may or may not have a condition in the form of checking the color of the cell on which the arrow is located.
Is this at all possible to solve?

Answer 1

Maybe. Passed a couple of years ago, even took to study, but refused, because you need a lot of free time. Ideally not studying and not working

Answer 2

1. Move forward
2. If orange turn left
3. If green turn left
4. If blue move forward
5. F1