must be done in c sharp
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 o (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? Design and implement the following operations for the rope class. The notation s[i,il is used to represent the substring that begins at index i and ends at Indexj. Assume as well that the maximum size of a leaf substring is no more than 10 Rope(5): Create a rope from a given string s Substring (0,Jji: Return the substring st.n Split (i): Return the two ropes split at indexi Insertis, i: Insert string s at index i. Concatenate (R1, R2): Concatenate ropes R1 and R2 Delete (i,j: Delete the substring s [,i Find S): Return the index of the first occurrence of 5,-1 otherwise CharAt (): Return the character at index i Print 0: Print the string represented by the rope 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 o (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? Design and implement the following operations for the rope class. The notation s[i,il is used to represent the substring that begins at index i and ends at Indexj. Assume as well that the maximum size of a leaf substring is no more than 10 Rope(5): Create a rope from a given string s Substring (0,Jji: Return the substring st.n Split (i): Return the two ropes split at indexi Insertis, i: Insert string s at index i. Concatenate (R1, R2): Concatenate ropes R1 and R2 Delete (i,j: Delete the substring s [,i Find S): Return the index of the first occurrence of 5,-1 otherwise CharAt (): Return the character at index i Print 0: Print the string represented by the rope
