Can someone make a matlab code for this without using arrays?

Lab #10-Programming Assignment Due: Friday July 20, 2018 at 11:00pm (time local to West Lafayette, IN) 5 Points Possible Problem: Given an external data file named (exactly) labData which contains an unknown number of non-negative integers, perhaps a long long non-negative integers, remove adjacent pairs of digits that are the same. Show the number after you make each change. The process will continue until there are no longer adjacent pairs in the number. When more than one adjacent pair of digits are present in a number you should first remove the pair that is found in the lower power of 10 (closer to the ones place in the number). Other specifications: All data will be found in a file called labData, (do not add an extension to or alter this file name). All output is to the monito Contents of labData external file: 1233456 1123456 1234566 12233445 123456 223344 72344327 1102201 Example Execution #1 Original value1233456 Changes: 12456 Original value1123456 Changes: 23456 Original value1234566 Changes: 12345 Original value - 12233445 Changes: 122335 122515 Original value123456 Changes: None Original value -> 223344 Changes: 2233 -22-> 0 Original value 72344327 Changes:723327-7227-77-0 Original value1102201 Changes: 11001-111 -> 1 Example Execution #2: Original value10101010 Contents of labData external file: 10101010 100001000001 Changes: None Original value-100001000001 Changes: 1000010001> 10000101 100101-1101-1