do at least 5 of the methods, code must be done in c# with comments for explanation need asap

Ropes A string is a sequence of characters and is often implemented as a fixed-length array of characters. Therefore, operations like concatenate, split, and insert/delete a substring can consume(n) time where n is the total length of the stringis). One alternative implementation for very long strings is ropes. A rope is a binary tree whose leaf Nodes represent snippets of the overall string (see example at the end). In this example, each node Is augmented with an integer that represents the length of the string in its left subtree. However To ensure that concatenation runs in o (1) time, it may be better to store the total length rooted a Particular node. Why? Your task is to design, implement, and test the following operations for the rope Class. The notation S : is used to represent the substring that begins at index i and ends at Indexj. Assume as wall that the maximum size of a leaf substring is 10. Rope(5): Create a rope from a given string s Inserts, ij: Insert string S at index i Dalete ,j: Delete the substring STi j- Substring (,il: Return the substring s li;j Find S): Return the index of the first occurrence of S,-1 otherwise CharAt(): Return the character at index i. Split (i): Return the two ropes s ConcatenaR1, R2): Concatenate ropes R1 and R2. Print 0: Print the string represented by the rope. plit at indexi. References Hans-J. Boehm, Russ Atkinson, and Michael PlaE, Ropes: an Alternative to Strings, Software Practice and Experience, Volume 25(12), December 1995, pp 1315-1330 Dale king, Ropes Fast Strings, January 2, 2017 Rope (data structurel, Wikipedia, retrieved on March 13, 2018 Ropes A string is a sequence of characters and is often implemented as a fixed-length array of characters. Therefore, operations like concatenate, split, and insert/delete a substring can consume(n) time where n is the total length of the stringis). One alternative implementation for very long strings is ropes. A rope is a binary tree whose leaf Nodes represent snippets of the overall string (see example at the end). In this example, each node Is augmented with an integer that represents the length of the string in its left subtree. However To ensure that concatenation runs in o (1) time, it may be better to store the total length rooted a Particular node. Why? Your task is to design, implement, and test the following operations for the rope Class. The notation S : is used to represent the substring that begins at index i and ends at Indexj. Assume as wall that the maximum size of a leaf substring is 10. Rope(5): Create a rope from a given string s Inserts, ij: Insert string S at index i Dalete ,j: Delete the substring STi j- Substring (,il: Return the substring s li;j Find S): Return the index of the first occurrence of S,-1 otherwise CharAt(): Return the character at index i. Split (i): Return the two ropes s ConcatenaR1, R2): Concatenate ropes R1 and R2. Print 0: Print the string represented by the rope. plit at indexi. References Hans-J. Boehm, Russ Atkinson, and Michael PlaE, Ropes: an Alternative to Strings, Software Practice and Experience, Volume 25(12), December 1995, pp 1315-1330 Dale king, Ropes Fast Strings, January 2, 2017 Rope (data structurel, Wikipedia, retrieved on March 13, 2018