Compute the distance between the positions of the first and last zero element in the given array. For example if the array is XXXXXXXXXXyour algorithm should yield 7 - 1 = 6. If the array contains a...

Compute the distance between the positions of the first and last zero element in the given array. For example if the array is 3 0 1 0 4 9 5 0 6 your algorithm should yield 7 - 1 = 6. If the array contains a single zero return 0. If it doesn’t contain any zeros return a negative value Only edit code within the /*Your code goes here*/ portion.

Extracted text: ) src) Numbers PasswordGenerator.java = PrintDemo.java X A G Pyramids.java × Prog06_PartyPooper.java X public class Numbers CObes 1 DoLoop 2 G Doublelnvesti G DuplicatedCh 3 @ G EarthquakeSt 4 GElevatorSimul 5 public static int zeroesDistance(double[] values) { int firstPos = 0; int lastPos = values. Length - 1; Error1 6 Error2 7 boolean found = false; G Error3 while (firstPos < values.length="" &&="" !found)="" 8="" o="" findspaces="" 9="" a="" firstvowel.jav="" *="" your="" code="" goes="" here="" */="" 10="" g="" geometry="" g="" grades="" 11="" 12="" return="" lastpos="" -="" firstpos;="" helloprinter="" g="" integername|="" 13="" g="" investmenttal="" 14="" l="" joh661.zip="" numbers="" passwordgen="" g="" powertable="" g="" printdemo="" printtableder="" g="" prog06_party="" g="" pyramids="" g="" randomdemd="" greadtime="" greciprocalsu="" removedupli="" g="" sentineldemd=""> G Seperators.ja G Shipping G TaxCalculator G test UniqueChars Velumed Run: O ArrayDemo x ZUsers/jacobjohnston/Library/Java/JavaVirtualMachines/openidk-16.0.2/Contents/Home/bin/java -j- 0 246 8 Fred Amy Cindy Henry 42 2 4 6 8 Enter scores, -1 to quit: 12 25 20 0 10 -1 You entered the following scores: 12 25 20 0 10 Process finished with exit code 0 E TODO O All files are up-to-date (10/30/21, 2:15 PM) > Run O Problems 2 Terminal K Build * Favorites Structure 4/- 印|1|大