Write an ALP that will examine a set of strings. The length of each string is four characters. The number of strings to be examined is stored in location 'STR1'. The modified strings are stored starting from location 'DAT1'. The ALP should scan each string and see if it is equal to' '(four blank spaces). If yes, all strings that follow this string of four

blank spaces should be reversed until the next string of fou blank spaces is encountered.

For e.g. if the set of strings are: 'math', 'have',' , 'bury', 'mine', 'dine',' ', 'hell', 'deep', 'tree The ALP should change it to 'math', 'have',' , 'yrub', 'enim', 'enid',' ', 'hell', 'deep', 'tree' Tave the cam avion submit a cinale DDC file