Can I please get help!

Please do I and II. I will upvote. Thank you!

I Last Position of Target Find the last position of a target number in a sorted array Return -1 if target does not exist. Example Given [1, 2, 2, 4, 5, 5] For target = 2, return 2 For target = 5, return 5 For target = 6, return -1 I I Search in Rotated Sorted Array Given an integer array nums sorted in ascending order, and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0, 1, 2, 4, 5, 6, 7] might become [4, 5, 6, 7, 0, 1, 2]) You should search for target in nums and if you found return its index, otherwise return -1 Note: You can not modify the input array, you only allow to use binary search to solve these two problems You must write C program