Write a method that compares the first few digits of 'original' to the entire 'target'. If the first few digits of 'original' exactly match all of the 'target' digits, in the same order, return the total number of digits in 'target'. Otherwise return -1 as a special value to indicate failure to find the 'target' digits at the start of 'original'. Both 'original' and 'target' will be positive integers. If 'target' has more digits than 'original' return -1 since 'target' cannot fit in 'original'. You may NOT use ANY strings or string methods. Look at the test data for examples.