Code the below following in Python.

Assume that the input is two non empty sorted arrays. Your output should be the median of the two sorted arrays. A naive solution is combining both arrays to form an array of size (m+n) and thereafter take the median of the combined string. That will be O(m+n). However in this question, you are limited to a overall run time complexity in O(log (m+n).

Input 1,3,5,6

2,4,6,8,9

Output 5