In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Given LinkedList and K=2, N=4

1->2->3->4->5->6->7->8->9

so Partitioned LinkedList will be

1->2->3->4->5->6->7->8->9

Now delete first K nodes from each subpart and return linked list

3->4->7->8

Here first 2 nodes are deleted from each subparts.

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Consider above question with specific input.
Consider a series in which 8 teams are participating. Each team plays twice with all other teams.
4 of them will go to the semi final.
Minimum and Maximum how many matches should a team win, so that it will ensure that it will go to semi finals ?