Implement in C++ a QueueADT that does the following:

13) BTFSC DATA1,3. BRA LABEL1 RLNCF DATA2,W LABEL2 BRA LABEL1 RRNCF DATA3,W LABEL2 NOP WREGE

Hi, I am looking for some help to solve this question. I cannot figure out how to solve it and the code below is all I have. Please be advised I am using PostgreSQL. Thus, I must use LANGUAGE PLPGSLQ as that is what the professor is looking for. Thank you for your help. Code CREATE TABLE instructor_course_nums (ID VARCHAR(25), name VARCHAR(25), tot_courses VARCHAR(25)); CREATE TEMPORARY TABLE instructor_course_nums (ID VARCHAR(5),name VARCHAR(20),tot_courses INTEGER); CREATE OR REPLACE PROCEDURE Moreno_03_insCourseNumsProc(INOUT i_ID VARCHAR(5))LANGUAGE PLPGSQLAS$$

Address ValidationImagine you get a data set from a client that contains addresses from 150 countries all around the world and your task is to verify it, the data is stored in 3 fields – Address Line, City, and ZIP code. What you also have available is an address verification solution for each country, but the data set does not include the country code. Your task is to design a logic that will process the data and find the related country for each record, so they can be run through the relevant validation component. Think of the most efficient way. Describe your solution proposal ideally in an algorithmic way (e.g. using appropriate UML diagrams, pseudo-code, list of steps…)Hint: Running all of those 150 address verification components against each record is not considered efficient