please do it in flowgorithm and screenshot me or paste it in a word document.

II. Implement the given problem for flowchart using flowgramming. Given an array of 'n' positive integers, Write a menu driven program to do the following task, a Find The Position Of Number K In The Given List. b. swap every ith element of the array with (i+2) h element. C. count the number of distinct pairs of integers in the array that have the sum divisible by a user input number x Sample Input/Output Input Size of Array :6 elements :16 17 4352 Output a. For K=4 Position:2 6. New array=[4 3 5 2 16 17] swapping the elements at postion 0 and 2 yields - [4 17 16 3 5 2] swapping the elements at position 1 and 3 yields-[4 3 16 17 5 2] swapping the elements at postion 2 and 4 yields-[4 3 5 17 16 2] swapping the elements at position 3 and 5 yields- [4 3 5 2 16 17] c-x=4 (16,4) (17,3)