Using Python

first write algorithm and find the running time function T(n), and express the running time function of the algorithm in terms of -notation.

Include python code as well

Write an algorithm that combines two given strings S and T such that each letter located in position i of string Tresides between two letters i and i +1 in string S. For example: Input: S = ABCD and T= WXYZ Output = AWBXCYDZ Note: You can assume strings S and T are in the same length