Create a C# Windows Form App in Visual Studio. THE ANSWER MUST BE IN C#.

Linked List Problemes Delete N nodes after M nodes of a linked list Given a linked list and two integers M and N. Traverse the linked list such that you retain M nodes then delete next N nodes, continue the same till end of the linked list Difficulty Level: Rookie Examples Input: M=2, N = 2 Linked List: 1- >2->3-4->5- >6-7->8 Output: Linked List: 1->2-5->6 Input: M3, N2 Linked List: 1->2-3->4->5->6->7->8->9-10 Output: Linked List: 1->2-3->6->7->8 Input: M-1, N 1 Linked List: 1->2->3-4->5->6-7->8->9-10 Output: Linked List: 1->3->5- >7-9