Implement Prototype(tokens []string) (bool,error) using pair reduction and Solve using a stack. Each reached token must be exactly LOAD:label or UNLOAD:label, with a nonempty label and exactly one colon. Invalid reached tokens return error. Return false immediately at the first ordering violation without inspecting later tokens. Empty input is true; leftover loads make false. Preserve input.
Edit exercise.go; retain the public types and signatures. prototype and final are separate stages. The executable tests recover panics as failures, report named checks, and exit nonzero on any failure. A successful run must execute at least one check. Tests use logical time or explicit synchronization where relevant.
Complete the starter code, then run the checks.
Results and errors will appear here.