Parallelization Optimization for Hash Calculation

[liudi4046]

1. In function sequencingBatchStep, it gets new transactions from pool, then compute the hash for each new transaction. This can be done in parralel.

	newTransactions, newIds, allConditionsOK, err = getNextPoolTransactions(ctx, cfg, executionAt, batchState.forkId, batchState.yieldedTransactions)
	if err != nil {
		return err
	}

	batchState.blockState.transactionsForInclusion = append(batchState.blockState.transactionsForInclusion, newTransactions...)
	for idx, tx := range newTransactions {
		batchState.blockState.transactionHashesToSlots[tx.Hash()] = newIds[idx]
	}

2. In function extractTransactionsFromSlot, same idea can be applied when calling SenderWithContext.

Result

In my macbook pro m3, TPS slightly increased from 932 to 946. And pprof shows the time spent on sequencingBatchTransactions has decreased.

related PR: #1599