I know that this tip is hard too implement: But don't stress out. Try to understand the questions, and what they mean. Clarify what you need to know. Have a look at the lecture contents. You can do that. I really believe in you.
Let's talk about it in detail. There are these slides:
https://es.cs.uni-kl.de/teaching/vrs/slides/VRS-04-TransitionSystems-1.pdf
Task 1: You are asked to tell what are the existential/universal predecessors/successors of no states, and all states. Look at the definitions on slide 49. Plug in all states / no states, and see whether the results are deadends, non-deadends, states with or without predecessors.
Task 2:
a) Given a formula for initial states, and transitions, write down the transitions explicitly. That's on slide 53. On the following slides, there's an example.
b,c,d) Look at the initial states, deadends, reachable states of the Kripke structure. Write them down as a DNF.
Task 3:
Similar to 2. Identify certain sets of states, write them down as DNF. Also write down a modified structure in the required syntax.
Task 4:
On slide 45, we introduce how a product is computed (take state pairs that agree on the label for common variables as new states, add transitions add transitions if the transition was present for both elements, mark states initial whose both elements were inital). In the exercise, you are asked to compute a product just like it's done as an example on slide 47.
So as you see. There is really no big rocket science. You can easily do your first run through that.
We all believe in you! Go for it! :)
