How to solve this kinda sets?

In a game named ‘Pelton wheel’, natural numbers 1 to 12 are arranged along the circumference of a circle in a way similar to the dial of a clock. In the game, the pointer is placed initially on any of the 12 numbers. In one move, a player can move the pointer by one place in the clockwise direction or in the counter-clockwise direction or move it to the diametrically opposite number on the wheel.

Following are the rules of the game:

1)One round consists of three consecutive moves. The pointer has to be at different number every time in a given round.

2)Initially, a player starts with zero points. In each move of each round, a player gets certain number of points according to the rules (given below). It is possible to score negative points in a move.

3)The second and each subsequent round begins from the same number and with the same points where the previous round has ended.

4)If the pointer is moved in a clockwise direction in a move to number ‘N’, the player gets ‘N’ points in that move.

5)If the pointer is moved in a counter-clockwise direction in a move to number ‘N’, the player gets ‘N – 1’ points in that move.

6)If the pointer is moved to a diametrically opposite number ‘N’, the player gets ‘N – 2’ points in that move.

7)A player must have exactly one move in each round, wherein the pointer is moved to a diametrically opposite number.

Q1)What is the maximum possible score at the end of the first round if a player can select the number where he/she wants to place the pointer at the beginning of the round?

Q2)On which of the following positions should the pointer be placed at the beginning of the first round such that a player scores a maximum of 29 points in that round?

Q3)Additional information: Suppose a player plays the game for two rounds and can decide the placement of the pointer (say at number X) at the beginning of the first round.

Further:

N1 = The maximum possible score in the first round corresponding to pointer position X.

N2 = The score in the second round.

What is the maximum possible value of N1 + N2?

Q4)Additional information: Suppose a player plays the game for two rounds and can decide the placement of the pointer (say at number X) at the beginning of the first round.

Further:

N1 = The maximum possible score in the first round corresponding to pointer position X.

N2 = The score in the second round.

Which of the following positions can be chosen for placing the pointer at the beginning of the first round if a player wants to maximize the value of N1 + N2?

A)3

B)4

C)6

D)8

@IIM_Groot

@Shankarji please explain

@Shankarji bro, please help me with this set