1) Algorithm A1: InsertElement (LA, ITEM, N, K). 1. [Initialize Counter] Set J:=N 2. Repeat Steps 3 and 4 while J≥K 3. [Move Jth element downward] Set LA[J+1] := LA[J] 4. [Decrease counter] Set J:=J-1...

1) Algorithm A1: InsertElement (LA, ITEM, N, K).
1. [Initialize Counter] Set J:=N
2. Repeat Steps 3 and 4 while J≥K
3. [Move Jth element downward]
Set LA[J+1] := LA[J]
4. [Decrease counter] Set J:=J-1
[End of Step 2 loop]
5. [Insert element] Set LA[K]:=ITEM
6. [Reset N] N:= N+1
7. Exit

Q. Implement the above algorithms in C/C++