please do it in pytho

5 1. Given a list of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Examples: Input: [2,7,11,15], target =9 0utput: [0,1] Because nums [0]+nums[1]=2+7=9, return [0,1]. Input: [12,23,11,3,6,19,6], target=17 Output: [1,4] Input: [2,4,6,8,10],target=9 If Output: [] 2. Write a function to find the longest common prefix string amongst a list of strings. Examples: Input: ["flower", "flow", "flight"] output: "fl" Input: ["dog", "racecar", "car"] output: " Explanation: There is no common prefix anong the input strings, return an empty string