please solve this

1. Which option is not a basic issue related to Algorithms? 1. Designing algorithms 5. Optimization of algorithms 6. Designing the programming language to implement algorithms 2- What are the input size and the basic operation of an algorithm that searches for a key K in an array A of n integers? 1. Input size =n and basic operation is If A[1]=K 2. Input size =A and basic operation is If A[i]=K 3. Input size =n and basic operation is if A[i]=n 4. Input size =A and basic operation is If A[n]=K 3. Given the following Algorithm where Arr is an array of size n : n Arr Function fi(Arr, n) sum = For ( i= suM ;icn;i++) End For RuM + Arr[i] Return sum End Function What is the complexity time using Count Frequency Method, knowing that X=X+B costs two operations? . Frequency Count Method complexity time 1. 4n+4 2. n 3. 2n 4. 4n+8 5. None of the above