this is supposed to be implemented with seed = 'z'

a) Write a pseudocode which will count and sum all of the data elements that have BIT13 =1 or BIT10 =0 or (BIT7=0 and BIT2=1 ) BITS are numbered from 0 (i.e. LSB) to 15 (i.e. MSB). Your program should also identify the position number of the first and last data element that matches this filtering condition. That is, as values are being retrieved from myData, how many function calls are needed to retrieve the first element matching the filtering condition and how many are needed to retrieve the last element matching the condition All values are considered 16 -bit unsigned values. b) Using CCS, implement your pseudocode in the C programming language. Store the sum in vSum, the count value in vCount, the count position of the first value in vFirst, and the count position of the last value in vLast. Print the results to the terminal in decimal using the specified format. c) Submit your pseudocode, C code, copy/paste (or screen capture) of CCS Terminal (Console) output using the specified format (One pdf and the zip file of your project)