Hi i need help for the following python topics & functions :

$1)$Merge Sort,

$2)$sort function that repeatedly swaps adjacent elemenrs if they are in wrong order

$3)$ divide and conquer approach,

$4)$ binary sort

Please explain with examples for the expected output.

Also please help to develop a recursive function, called merge$\_$strings. that accepts two strings as the input parameters, let's call them C and D$,$ and merges them in a particular way, where characters of C from left to right are interlaced by characters of D from right to left, one by one. Then, eventually, your function returns the string answer. The length of C and D could be different. C and D could be empty strings.

Examples:

C $=$ "apple"

D $=$ "banana"

result $=$ merge$\_$strings$($C$,$ D$)$

print$($result$)$ # Expected output: "aapnpalneab"

C$="23"$

D $=$ "hello world!"

result $=$ merge$\_$strings$($C$,$ D$)$

print$($result$)$ # Expected output: $"2!3$dlrow olleh"

F $="2345678899"$

G$="!"$

result $=$ merge$\_$strings$($F$,$ G$)$

print$($result$)$ #Expectedoutput:$2!345678899$

Thank you.