Exercise $7($Braiding$)$

In this assignment, we wil create two methods.

$($a$)$ Create the methed public static String mergesString $8,$ String it$.$ The method must "merge" lwo

strings s and $t$ so that the reshit is a string where every other character comes from $8,$ and every

other character comes from t it a and thave different lengths, what is "eftover" must be added in

the back.

The method should retum the concatenatod string. The following examples show areas of use.

String a $=$ mergo$|"$ABC$",$ "DEF"l W a is now

"ADBECF" a $=$

merge$(7/$JKLMN$*,$"OPCF$)$; $/$f a is now

$\text{'}$TO$.$JPKOLMMN' a $=$ merge$($C$*,$

$"$AB$"$;;$/\backslash$ a is now $"$AB$"$

Empty strings are legal input.

$($b$)$ Creste the method public static String merge$($String$...8).$ The method must "merge" together all the

strings in the table $8.$ The merging must successively retrieve the first character from the firgt

string, then the first character from the second atring, and then

Machine Translated by Google

further. After the last string we start again with now other characters from the first

string, then other characters from the second string, and so on$.$ An "exhausted"

string must be skipped. The concatenated string should be returned. The following

example shows the area of use.

String a $=$ merge$(\text{'}$AM $","$L$",$ "GEDS", "ORATKRR", $"*,$

$\text{'}$R TRTE", $"10",$ "TGAUU"$)$; $//$ a is

now "ALGORITHMS AND DATA STRUCTURES"

It should not give an error message to submit zero strings $($but the response should

then be an empty string$),$ or one string $($but the response should then be the same string$).$

Hint: By using a double for loop, you can almost loop through siDj$],$ where i corresponds

to which "word" you're on$,$ and j is which "letter" you've reached. But note that we will go

through $j$ "slower" than i$.$