al/usr/bin/pythona def deduplicate(array): return the total number of unique elements in array for example for array - (1,19,2,1,1,5,1,1,1,1,2), return 6 array - 15,5,5,5), return 1 array - 11,1,1,1,1,2,2,2,3,3,3,3), return return -1 def tasum(array, target) Given an array of interpers array and Integer turert, return indfors of the two numbers such that they add up to target, and also return the two numbers. 1 2 the should be in You may assume that each input would have exactly one solution, and you may not use the same element twice. 24 25 For example, array - (2,7,11,15), target - 9 return (0, 1, 3, 7) as array[0] rray(1) >9 28 29 return (ote, one, home, hone) 13 del computer bonacci(n): Return the nth Fibonacci tuber Tibonacel Series 0,1,1,2,3,5,8,13. Fill Pytha LAT 64bit AO To here to search AI in L Colt Space UTF-8 CH 52 33 34 def computeFibonacci(n): 35 36 37 38 39 Return the nth Fibonacci number Fibonacci Series: 0,1,1,2,3,5,8,1 oth Fibonacci number is @ 1st Fibonacci number is 1 2nd Fibonacci number is 1 and so on return -1 40 41 42 43 44 45 46 42 AB 49 50 51 52 53 54 55 56 57 58 59 def climbstairs(n): There are steps to reach the top of a building. Each time you can either climb 1 or 2 steps. Return the total number of distinct ways can you climb to the top? For example: when n = 1 return 1 (1 step) when - 2 return 2 (1 step + 1 step OR 2 step) when n - 3 return 3 (1 step + 1 step + 1 step OR 2 step + 1 step OR 1 step + 2 step) return -1